This HTML5 document contains 63 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:David_Avis
dbo:wikiPageWikiLink
dbr:Reverse-search_algorithm
Subject Item
dbr:Polymake
dbo:wikiPageWikiLink
dbr:Reverse-search_algorithm
Subject Item
dbr:Komei_Fukuda
dbo:wikiPageWikiLink
dbr:Reverse-search_algorithm
Subject Item
dbr:Vertex_enumeration_problem
dbo:wikiPageWikiLink
dbr:Reverse-search_algorithm
Subject Item
dbr:Polygonalization
dbo:wikiPageWikiLink
dbr:Reverse-search_algorithm
Subject Item
dbr:Reverse-search_algorithm
rdfs:label
Reverse-search algorithm
rdfs:comment
Reverse-search algorithms are a class of algorithms for generating all objects of a given size, from certain classes of combinatorial objects. In many cases, these methods allow the objects to be generated in polynomial time per object, using only enough memory to store a constant number of objects (polynomial space). (Generally, however, they are not classed as polynomial-time algorithms, because the number of objects they generate is exponential.) They work by organizing the objects to be generated into a spanning tree of their state space, and then performing a depth-first search of this tree.
dcterms:subject
dbc:Search_algorithms dbc:Combinatorial_algorithms
dbo:wikiPageID
71470682
dbo:wikiPageRevisionID
1102757166
dbo:wikiPageWikiLink
dbr:Monomial_ideal dbr:Laman_graph dbr:Polynomial_space dbr:Minkowski_sum dbr:Combinatorics dbr:Hydrocarbon dbr:Linear_programming dbr:Half-space_(geometry) dbr:Call_stack dbr:Hyperplane_arrangement dbr:Topological_ordering dbr:Simplex_algorithm dbr:Komei_Fukuda dbr:Polyiamond dbr:David_Avis dbr:Delaunay_triangulation dbr:Matroid dbr:Polyomino dbr:Algorithm dbr:Arrangement_of_hyperplanes dbr:Polyhex_(mathematics) dbr:Directed_acyclic_graph dbc:Search_algorithms dbr:Euclidean_space dbr:Depth-first_search dbr:Point-set_triangulation dbr:Polygonalization dbr:Convex_polytope dbr:Hyperplane dbr:Polyhedral_graph dbr:Implicit_graph dbr:Polynomial_time dbr:Vertex_enumeration_problem dbr:Vertex_(geometry) dbr:Prototile dbr:Spanning_tree dbr:Maximal_independent_set dbr:Induced_subgraph dbr:Maximal_planar_graph dbr:Euler_tour dbr:Sparse_graph dbc:Combinatorial_algorithms dbr:State_space
owl:sameAs
wikidata:Q113570670 n14:GPqdV
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:R
dbo:abstract
Reverse-search algorithms are a class of algorithms for generating all objects of a given size, from certain classes of combinatorial objects. In many cases, these methods allow the objects to be generated in polynomial time per object, using only enough memory to store a constant number of objects (polynomial space). (Generally, however, they are not classed as polynomial-time algorithms, because the number of objects they generate is exponential.) They work by organizing the objects to be generated into a spanning tree of their state space, and then performing a depth-first search of this tree. Reverse-search algorithms were introduced by David Avis and Komei Fukuda in 1991, for problems of generating the vertices of convex polytopes and the cells of arrangements of hyperplanes. They were formalized more broadly by Avis and Fukuda in 1996.
prov:wasDerivedFrom
wikipedia-en:Reverse-search_algorithm?oldid=1102757166&ns=0
dbo:wikiPageLength
16942
foaf:isPrimaryTopicOf
wikipedia-en:Reverse-search_algorithm
Subject Item
wikipedia-en:Reverse-search_algorithm
foaf:primaryTopic
dbr:Reverse-search_algorithm