| http://dbpedia.org/ontology/abstract
|
No estudo de algoritmos de grafos, uma rep … No estudo de algoritmos de grafos, uma representação por grafo implícito (ou mais simplesmente grafo Implícito) é um grafo em que os vertices ou arestas não são representados como objetos explícitos na memória de um computador, mas sim, determinados algoritmicamente a partir de alguma entrada.goritmicamente a partir de alguma entrada.
, In the study of graph algorithms, an impli … 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. input, for example a computable function.
|
| http://dbpedia.org/ontology/wikiPageID
|
24109545
|
| http://dbpedia.org/ontology/wikiPageLength
|
22354
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1114003650
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Induced_subgraph +
, http://dbpedia.org/resource/Black_box_group +
, http://dbpedia.org/resource/Distance-hereditary_graph +
, http://dbpedia.org/resource/PSPACE +
, http://dbpedia.org/resource/Hereditary_property +
, http://dbpedia.org/resource/Algorithm +
, http://dbpedia.org/resource/Nondeterministic_Turing_machine +
, http://dbpedia.org/resource/Circle_graph +
, http://dbpedia.org/resource/Graph_algorithm +
, http://dbpedia.org/resource/Adjacency_matrix +
, http://dbpedia.org/resource/Category:Graph_theory +
, http://dbpedia.org/resource/Vertex_%28graph_theory%29 +
, http://dbpedia.org/resource/Complexity_class +
, http://dbpedia.org/resource/Comparability_graph +
, http://dbpedia.org/resource/Computational_complexity_theory +
, http://dbpedia.org/resource/SL_%28complexity%29 +
, http://dbpedia.org/resource/Intersection_graph +
, http://dbpedia.org/resource/NL_%28complexity%29 +
, http://dbpedia.org/resource/Nash_equilibrium +
, http://dbpedia.org/resource/PLS_%28complexity%29 +
, http://dbpedia.org/resource/Chordal_graph +
, http://dbpedia.org/resource/Handshaking_lemma +
, http://dbpedia.org/resource/Directed_acyclic_graph +
, http://dbpedia.org/resource/Planar_graph +
, http://dbpedia.org/resource/Aanderaa%E2%80%93Karp%E2%80%93Rosenberg_conjecture +
, http://dbpedia.org/resource/PPA_%28complexity%29 +
, http://dbpedia.org/resource/NP_%28complexity%29 +
, http://dbpedia.org/resource/Relativization +
, http://dbpedia.org/resource/PPAD_%28complexity%29 +
, http://dbpedia.org/resource/Quantum_computer +
, http://dbpedia.org/resource/Algorithmic_game_theory +
, http://dbpedia.org/resource/Universal_graph +
, http://dbpedia.org/resource/Bipartite_graph +
, http://dbpedia.org/resource/Search_algorithm +
, http://dbpedia.org/resource/Group_theory +
, http://dbpedia.org/resource/Rubik%27s_Cube +
, http://dbpedia.org/resource/Arboricity +
, http://dbpedia.org/resource/Boxicity +
, http://dbpedia.org/resource/Line_segment +
, http://dbpedia.org/resource/Adjacency_list +
, http://dbpedia.org/resource/Polynomial_time +
, http://dbpedia.org/resource/Matroid_oracle +
, http://dbpedia.org/resource/Computable_function +
, http://dbpedia.org/resource/Reachability +
, http://dbpedia.org/resource/Neighborhood_%28graph_theory%29 +
, http://dbpedia.org/resource/Order_dimension +
, http://dbpedia.org/resource/Unit_disk_graph +
, http://dbpedia.org/resource/Interval_graph +
, http://dbpedia.org/resource/Degeneracy_%28graph_theory%29 +
, http://dbpedia.org/resource/Forbidden_graph_characterization +
, http://dbpedia.org/resource/Category:Graph_data_structures +
, http://dbpedia.org/resource/Cograph +
, http://dbpedia.org/resource/Real_line +
, http://dbpedia.org/resource/Matroid +
, http://dbpedia.org/resource/Treewidth +
, http://dbpedia.org/resource/Partially_ordered_set +
, http://dbpedia.org/resource/Robertson%E2%80%93Seymour_theorem +
, http://dbpedia.org/resource/Graph_%28discrete_mathematics%29 +
, http://dbpedia.org/resource/Triangle-free_graph +
, http://dbpedia.org/resource/NP-complete +
, http://dbpedia.org/resource/Directed_graph +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Unsolved +
, http://dbpedia.org/resource/Template:Math +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Log-star +
, http://dbpedia.org/resource/Template:Mvar +
, http://dbpedia.org/resource/Template:Short_description +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Graph_data_structures +
, http://dbpedia.org/resource/Category:Graph_theory +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Graph +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Implicit_graph?oldid=1114003650&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Implicit_graph +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q6007291 +
, http://pt.dbpedia.org/resource/Grafo_impl%C3%ADcito +
, https://global.dbpedia.org/id/4n3xx +
, http://yago-knowledge.org/resource/Implicit_graph +
, http://rdf.freebase.com/ns/m.07k98c9 +
, http://dbpedia.org/resource/Implicit_graph +
|
| rdf:type |
http://dbpedia.org/class/yago/Arrangement105726596 +
, http://dbpedia.org/class/yago/Structure105726345 +
, http://dbpedia.org/ontology/Software +
, http://dbpedia.org/class/yago/Cognition100023271 +
, http://dbpedia.org/class/yago/DataStructure105728493 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/WikicatGraphDataStructures +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
|
| rdfs:comment |
No estudo de algoritmos de grafos, uma rep … No estudo de algoritmos de grafos, uma representação por grafo implícito (ou mais simplesmente grafo Implícito) é um grafo em que os vertices ou arestas não são representados como objetos explícitos na memória de um computador, mas sim, determinados algoritmicamente a partir de alguma entrada.goritmicamente a partir de alguma entrada.
, In the study of graph algorithms, an impli … 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. input, for example a computable function.
|
| rdfs:label |
Grafo implícito
, Implicit graph
|
