Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Bounded_expansion> ?p ?o }
Showing triples 1 to 54 of
54
with 100 triples per page.
- Bounded_expansion abstract "In graph theory, a family of graphs is said to have bounded expansion if all of its shallow minors are sparse graphs. Many natural families of sparse graphs have bounded expansion. A closely related but stronger property, polynomial expansion, is equivalent to the existence of separator theorems for these families. Families with these properties have efficient algorithms for problems including the subgraph isomorphism problem and model checking for the first order theory of graphs.".
- Bounded_expansion wikiPageID "47843724".
- Bounded_expansion wikiPageLength "8734".
- Bounded_expansion wikiPageOutDegree "34".
- Bounded_expansion wikiPageRevisionID "683083222".
- Bounded_expansion wikiPageWikiLink 1-planar_graph.
- Bounded_expansion wikiPageWikiLink Algorithm.
- Bounded_expansion wikiPageWikiLink Biclique-free_graph.
- Bounded_expansion wikiPageWikiLink Book_embedding.
- Bounded_expansion wikiPageWikiLink Book_thickness.
- Bounded_expansion wikiPageWikiLink Category:Graph_theory.
- Bounded_expansion wikiPageWikiLink Chromatic_number.
- Bounded_expansion wikiPageWikiLink Clique_problem.
- Bounded_expansion wikiPageWikiLink Degeneracy_(graph_theory).
- Bounded_expansion wikiPageWikiLink Dense_graph.
- Bounded_expansion wikiPageWikiLink Dominating_set.
- Bounded_expansion wikiPageWikiLink Dominating_set_problem.
- Bounded_expansion wikiPageWikiLink Erdős–Rényi_model.
- Bounded_expansion wikiPageWikiLink Euclidean_space.
- Bounded_expansion wikiPageWikiLink Genus.
- Bounded_expansion wikiPageWikiLink Graph_coloring.
- Bounded_expansion wikiPageWikiLink Graph_invariant.
- Bounded_expansion wikiPageWikiLink Graph_property.
- Bounded_expansion wikiPageWikiLink Graph_theory.
- Bounded_expansion wikiPageWikiLink Independent_set_(graph_theory).
- Bounded_expansion wikiPageWikiLink Intersection_graph.
- Bounded_expansion wikiPageWikiLink Linear_time.
- Bounded_expansion wikiPageWikiLink Logic_of_graphs.
- Bounded_expansion wikiPageWikiLink Maximum_independent_set_problem.
- Bounded_expansion wikiPageWikiLink Model_checking.
- Bounded_expansion wikiPageWikiLink Planar_graph.
- Bounded_expansion wikiPageWikiLink Planar_separator_theorem.
- Bounded_expansion wikiPageWikiLink Polynomial.
- Bounded_expansion wikiPageWikiLink Polynomial-time_approximation_scheme.
- Bounded_expansion wikiPageWikiLink Queue_number.
- Bounded_expansion wikiPageWikiLink Random_graph.
- Bounded_expansion wikiPageWikiLink Robertson–Seymour_theorem.
- Bounded_expansion wikiPageWikiLink Set_cover_problem.
- Bounded_expansion wikiPageWikiLink Shallow_minor.
- Bounded_expansion wikiPageWikiLink Sparse_graph.
- Bounded_expansion wikiPageWikiLink String_graph.
- Bounded_expansion wikiPageWikiLink Subgraph_isomorphism_problem.
- Bounded_expansion wikiPageWikiLink Time_complexity.
- Bounded_expansion wikiPageWikiLinkText "Bounded expansion".
- Bounded_expansion wikiPageWikiLinkText "bounded expansion".
- Bounded_expansion wikiPageWikiLinkText "polynomial expansion".
- Bounded_expansion hasPhotoCollection Bounded_expansion.
- Bounded_expansion wikiPageUsesTemplate Template:Reflist.
- Bounded_expansion subject Category:Graph_theory.
- Bounded_expansion hypernym Graphs.
- Bounded_expansion comment "In graph theory, a family of graphs is said to have bounded expansion if all of its shallow minors are sparse graphs. Many natural families of sparse graphs have bounded expansion. A closely related but stronger property, polynomial expansion, is equivalent to the existence of separator theorems for these families. Families with these properties have efficient algorithms for problems including the subgraph isomorphism problem and model checking for the first order theory of graphs.".
- Bounded_expansion label "Bounded expansion".
- Bounded_expansion wasDerivedFrom Bounded_expansion?oldid=683083222.
- Bounded_expansion isPrimaryTopicOf Bounded_expansion.