Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Dissociation_number> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples per page.
- Dissociation_number abstract "In the mathematical discipline of graph theory, a subset of vertices in a graph G is called dissociation if it induces a subgraph with maximum degree 1. The number of vertices in a maximum cardinality dissociation set in G is called the dissociation number of G, denoted by diss(G). The problem of computing diss(G) (dissociation number problem) was firstly studied by Yannakakis. The problem is NP-hard even in the class of bipartite and planar graphs.".
- Dissociation_number wikiPageID "31735504".
- Dissociation_number wikiPageLength "1451".
- Dissociation_number wikiPageOutDegree "8".
- Dissociation_number wikiPageRevisionID "618760640".
- Dissociation_number wikiPageWikiLink Bipartite_graph.
- Dissociation_number wikiPageWikiLink Category:Graph_invariants.
- Dissociation_number wikiPageWikiLink Graph_(mathematics).
- Dissociation_number wikiPageWikiLink Graph_theory.
- Dissociation_number wikiPageWikiLink Mathematics.
- Dissociation_number wikiPageWikiLink Mihalis_Yannakakis.
- Dissociation_number wikiPageWikiLink NP-hard.
- Dissociation_number wikiPageWikiLink NP-hardness.
- Dissociation_number wikiPageWikiLink Planar_graph.
- Dissociation_number hasPhotoCollection Dissociation_number.
- Dissociation_number wikiPageUsesTemplate Template:Cite_journal.
- Dissociation_number wikiPageUsesTemplate Template:Refbegin.
- Dissociation_number wikiPageUsesTemplate Template:Refend.
- Dissociation_number wikiPageUsesTemplate Template:Reflist.
- Dissociation_number subject Category:Graph_invariants.
- Dissociation_number hypernym Dissociation.
- Dissociation_number type Combinatoric.
- Dissociation_number type Field.
- Dissociation_number type Relation.
- Dissociation_number comment "In the mathematical discipline of graph theory, a subset of vertices in a graph G is called dissociation if it induces a subgraph with maximum degree 1. The number of vertices in a maximum cardinality dissociation set in G is called the dissociation number of G, denoted by diss(G). The problem of computing diss(G) (dissociation number problem) was firstly studied by Yannakakis. The problem is NP-hard even in the class of bipartite and planar graphs.".
- Dissociation_number label "Dissociation number".
- Dissociation_number sameAs m.0gtxbg0.
- Dissociation_number sameAs Q5282790.
- Dissociation_number sameAs Q5282790.
- Dissociation_number wasDerivedFrom Dissociation_number?oldid=618760640.
- Dissociation_number isPrimaryTopicOf Dissociation_number.