Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Pseudoforest> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Pseudoforest abstract "In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of vertices, such that no two cycles of consecutive edges share any vertex with each other, nor can any two cycles be connected to each other by a path of consecutive edges. A pseudotree is a connected pseudoforest.The names are justified by analogy to the more commonly studied trees and forests. (A tree is a connected graph with no cycles; a forest is a disjoint union of trees.) Gabow and Tarjan attribute the study of pseudoforests to Dantzig's 1963 book on linear programming, in which pseudoforests arise in the solution of certain network flow problems. Pseudoforests also form graph-theoretic models of functions and occur in several algorithmic problems. Pseudoforests are sparse graphs – they have very few edges relative to their number of vertices – and their matroid structure allows several other families of sparse graphs to be decomposed as unions of forests and pseudoforests. The name "pseudoforest" comes from Picard & Queyranne (1982).".
- Pseudoforest thumbnail Pseudoforest.svg?width=300.
- Pseudoforest wikiPageID "13511542".
- Pseudoforest wikiPageRevisionID "606205862".
- Pseudoforest hasPhotoCollection Pseudoforest.
- Pseudoforest title "Unicyclic Graph".
- Pseudoforest urlname "UnicyclicGraph".
- Pseudoforest subject Category:Graph_families.
- Pseudoforest subject Category:Matroid_theory.
- Pseudoforest type Abstraction100002137.
- Pseudoforest type Family108078020.
- Pseudoforest type GraphFamilies.
- Pseudoforest type Group100031264.
- Pseudoforest type Organization108008335.
- Pseudoforest type SocialGroup107950920.
- Pseudoforest type Unit108189659.
- Pseudoforest type YagoLegalActor.
- Pseudoforest type YagoLegalActorGeo.
- Pseudoforest type YagoPermanentlyLocatedEntity.
- Pseudoforest comment "In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of vertices, such that no two cycles of consecutive edges share any vertex with each other, nor can any two cycles be connected to each other by a path of consecutive edges. A pseudotree is a connected pseudoforest.The names are justified by analogy to the more commonly studied trees and forests.".
- Pseudoforest label "Pseudofloresta".
- Pseudoforest label "Pseudoforest".
- Pseudoforest sameAs Pseudofloresta.
- Pseudoforest sameAs m.03c7rcc.
- Pseudoforest sameAs Q7254793.
- Pseudoforest sameAs Q7254793.
- Pseudoforest sameAs Pseudoforest.
- Pseudoforest wasDerivedFrom Pseudoforest?oldid=606205862.
- Pseudoforest depiction Pseudoforest.svg.
- Pseudoforest isPrimaryTopicOf Pseudoforest.
