Implicit graph
In the study of graph algorithms, an implicit graph representation (or more simply implicit graph) is a graph whose vertices or edges are not represented as explicit objects in a computer's memory, but rather are determined algorithmically from some other input, for example a computable function.
2-satisfiabilityAanderaa–Karp–Rosenberg conjectureBlack box groupBreadth-first searchComplement graphHandshaking lemmaImmerman–Szelepcsényi theoremImplicit graph conjectureImplicit graph representationImplicitly-defined graphList of unsolved problems in mathematicsMatroid oraclePLS (complexity)Path expressionState space searchUniversal graph
Link from a Wikipage to another Wikipage
primaryTopic
Implicit graph
In the study of graph algorithms, an implicit graph representation (or more simply implicit graph) is a graph whose vertices or edges are not represented as explicit objects in a computer's memory, but rather are determined algorithmically from some other input, for example a computable function.
has abstract
In the study of graph algorith ...... example a computable function.
@en
No estudo de algoritmos de gra ...... te a partir de alguma entrada.
@pt
Wikipage page ID
24,109,545
page length (characters) of wiki page
Wikipage revision ID
1,019,169,677
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
In the study of graph algorith ...... example a computable function.
@en
No estudo de algoritmos de gra ...... te a partir de alguma entrada.
@pt
label
Grafo implícito
@pt
Implicit graph
@en