Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7254793> ?p ?o }
Showing triples 1 to 84 of
84
with 100 triples per page.
- Q7254793 subject Q7217193.
- Q7254793 subject Q8612141.
- Q7254793 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).".
- Q7254793 thumbnail Pseudoforest.svg?width=300.
- Q7254793 wikiPageWikiLink Q1087987.
- Q7254793 wikiPageWikiLink Q1137726.
- Q7254793 wikiPageWikiLink Q1167387.
- Q7254793 wikiPageWikiLink Q125977.
- Q7254793 wikiPageWikiLink Q1304193.
- Q7254793 wikiPageWikiLink Q131476.
- Q7254793 wikiPageWikiLink Q1326518.
- Q7254793 wikiPageWikiLink Q1340800.
- Q7254793 wikiPageWikiLink Q134164.
- Q7254793 wikiPageWikiLink Q1412924.
- Q7254793 wikiPageWikiLink Q141488.
- Q7254793 wikiPageWikiLink Q1415372.
- Q7254793 wikiPageWikiLink Q15284723.
- Q7254793 wikiPageWikiLink Q1584911.
- Q7254793 wikiPageWikiLink Q1588200.
- Q7254793 wikiPageWikiLink Q166507.
- Q7254793 wikiPageWikiLink Q1699014.
- Q7254793 wikiPageWikiLink Q174733.
- Q7254793 wikiPageWikiLink Q176916.
- Q7254793 wikiPageWikiLink Q189156.
- Q7254793 wikiPageWikiLink Q1974793.
- Q7254793 wikiPageWikiLink Q1992341.
- Q7254793 wikiPageWikiLink Q202843.
- Q7254793 wikiPageWikiLink Q2379946.
- Q7254793 wikiPageWikiLink Q240464.
- Q7254793 wikiPageWikiLink Q245595.
- Q7254793 wikiPageWikiLink Q2642629.
- Q7254793 wikiPageWikiLink Q2646614.
- Q7254793 wikiPageWikiLink Q272735.
- Q7254793 wikiPageWikiLink Q27670.
- Q7254793 wikiPageWikiLink Q2815652.
- Q7254793 wikiPageWikiLink Q2997928.
- Q7254793 wikiPageWikiLink Q3035340.
- Q7254793 wikiPageWikiLink Q3085841.
- Q7254793 wikiPageWikiLink Q310798.
- Q7254793 wikiPageWikiLink Q3115555.
- Q7254793 wikiPageWikiLink Q317088.
- Q7254793 wikiPageWikiLink Q339000.
- Q7254793 wikiPageWikiLink Q3527155.
- Q7254793 wikiPageWikiLink Q4420916.
- Q7254793 wikiPageWikiLink Q45715.
- Q7254793 wikiPageWikiLink Q4720939.
- Q7254793 wikiPageWikiLink Q477202.
- Q7254793 wikiPageWikiLink Q4784907.
- Q7254793 wikiPageWikiLink Q4796301.
- Q7254793 wikiPageWikiLink Q4846249.
- Q7254793 wikiPageWikiLink Q4903641.
- Q7254793 wikiPageWikiLink Q504353.
- Q7254793 wikiPageWikiLink Q504843.
- Q7254793 wikiPageWikiLink Q506615.
- Q7254793 wikiPageWikiLink Q512604.
- Q7254793 wikiPageWikiLink Q5166684.
- Q7254793 wikiPageWikiLink Q5254619.
- Q7254793 wikiPageWikiLink Q5282042.
- Q7254793 wikiPageWikiLink Q5411752.
- Q7254793 wikiPageWikiLink Q5467387.
- Q7254793 wikiPageWikiLink Q547823.
- Q7254793 wikiPageWikiLink Q5597156.
- Q7254793 wikiPageWikiLink Q592286.
- Q7254793 wikiPageWikiLink Q7217193.
- Q7254793 wikiPageWikiLink Q728415.
- Q7254793 wikiPageWikiLink Q7390256.
- Q7254793 wikiPageWikiLink Q739462.
- Q7254793 wikiPageWikiLink Q7453591.
- Q7254793 wikiPageWikiLink Q7661887.
- Q7254793 wikiPageWikiLink Q7959587.
- Q7254793 wikiPageWikiLink Q8366.
- Q7254793 wikiPageWikiLink Q847858.
- Q7254793 wikiPageWikiLink Q859176.
- Q7254793 wikiPageWikiLink Q8612141.
- Q7254793 wikiPageWikiLink Q8789.
- Q7254793 wikiPageWikiLink Q898572.
- Q7254793 wikiPageWikiLink Q905837.
- Q7254793 wikiPageWikiLink Q910404.
- Q7254793 wikiPageWikiLink Q913598.
- Q7254793 wikiPageWikiLink Q92695.
- Q7254793 wikiPageWikiLink Q946489.
- Q7254793 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.".
- Q7254793 label "Pseudoforest".
- Q7254793 depiction Pseudoforest.svg.