Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Vertex_cycle_cover> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples per page.
- Vertex_cycle_cover abstract "In mathematics, a vertex cycle cover (commonly called simply cycle cover) of a graph G is a set of cycles which are subgraphs of G and contain all vertices of G. If the cycles of the cover have no vertices in common, the cover is called vertex-disjoint or sometimes simply disjoint cycle cover. In this case the set of the cycles constitutes a spanning subgraph of G. A disjoint cycle cover of an undirected graph (if it exists) can be found in polynomial time by transforming the problem into a problem of finding a perfect matching in a larger graph.If the cycles of the cover have no edges in common, the cover is called edge-disjoint or simply disjoint cycle cover.Similar definitions may be introduced for digraphs, in terms of directed cycles.".
- Vertex_cycle_cover wikiPageID "20797548".
- Vertex_cycle_cover wikiPageLength "3032".
- Vertex_cycle_cover wikiPageOutDegree "18".
- Vertex_cycle_cover wikiPageRevisionID "671317902".
- Vertex_cycle_cover wikiPageWikiLink (0,1)-matrix.
- Vertex_cycle_cover wikiPageWikiLink APX.
- Vertex_cycle_cover wikiPageWikiLink Adjacency_matrix.
- Vertex_cycle_cover wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Vertex_cycle_cover wikiPageWikiLink Category:NP-complete_problems.
- Vertex_cycle_cover wikiPageWikiLink Complexity_class.
- Vertex_cycle_cover wikiPageWikiLink Cycle_(graph_theory).
- Vertex_cycle_cover wikiPageWikiLink Directed_graph.
- Vertex_cycle_cover wikiPageWikiLink Edge_cycle_cover.
- Vertex_cycle_cover wikiPageWikiLink Glossary_of_graph_theory.
- Vertex_cycle_cover wikiPageWikiLink Graph_(mathematics).
- Vertex_cycle_cover wikiPageWikiLink Logical_matrix.
- Vertex_cycle_cover wikiPageWikiLink Matching_(graph_theory).
- Vertex_cycle_cover wikiPageWikiLink NP-complete.
- Vertex_cycle_cover wikiPageWikiLink NP-completeness.
- Vertex_cycle_cover wikiPageWikiLink Perfect_matching.
- Vertex_cycle_cover wikiPageWikiLink Permanent.
- Vertex_cycle_cover wikiPageWikiLink Polynomial_time.
- Vertex_cycle_cover wikiPageWikiLink Sharp-P-complete.
- Vertex_cycle_cover wikiPageWikiLink Spanning_subgraph.
- Vertex_cycle_cover wikiPageWikiLink Time_complexity.
- Vertex_cycle_cover wikiPageWikiLinkText "Vertex cycle cover".
- Vertex_cycle_cover wikiPageWikiLinkText "cycle cover".
- Vertex_cycle_cover wikiPageWikiLinkText "vertex cycle cover".
- Vertex_cycle_cover hasPhotoCollection Vertex_cycle_cover.
- Vertex_cycle_cover wikiPageUsesTemplate Template:Reflist.
- Vertex_cycle_cover subject Category:Computational_problems_in_graph_theory.
- Vertex_cycle_cover subject Category:NP-complete_problems.
- Vertex_cycle_cover hypernym Set.
- Vertex_cycle_cover comment "In mathematics, a vertex cycle cover (commonly called simply cycle cover) of a graph G is a set of cycles which are subgraphs of G and contain all vertices of G. If the cycles of the cover have no vertices in common, the cover is called vertex-disjoint or sometimes simply disjoint cycle cover. In this case the set of the cycles constitutes a spanning subgraph of G.".
- Vertex_cycle_cover label "Vertex cycle cover".
- Vertex_cycle_cover sameAs m.053gz95.
- Vertex_cycle_cover sameAs Q17090992.
- Vertex_cycle_cover sameAs Q17090992.
- Vertex_cycle_cover wasDerivedFrom Vertex_cycle_cover?oldid=671317902.
- Vertex_cycle_cover isPrimaryTopicOf Vertex_cycle_cover.