Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5198174> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Q5198174 subject Q6465283.
- Q5198174 subject Q7022818.
- Q5198174 abstract "In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close adigraph is to a directed acyclic graph (DAG), in the sense that a DAG hascycle rank zero, while a complete digraph of order n with a self-loop ateach vertex has cycle rank n. The cycle rank of a directed graph is closely related to the tree-depth of an undirected graph and to the star height of a regular language. It has also found usein sparse matrix computations (see Bodlaender et al. 1995) and logic(Rossman 2008).".
- Q5198174 wikiPageExternalLink dmtcs12-revised.pdf.
- Q5198174 wikiPageExternalLink Cholesky_fmprg.pdf.
- Q5198174 wikiPageExternalLink icalp08.pdf.
- Q5198174 wikiPageExternalLink p256-schreiber%5B1%5D.pdf.
- Q5198174 wikiPageWikiLink Q1050404.
- Q5198174 wikiPageWikiLink Q1137726.
- Q5198174 wikiPageWikiLink Q1195339.
- Q5198174 wikiPageWikiLink Q126002.
- Q5198174 wikiPageWikiLink Q131476.
- Q5198174 wikiPageWikiLink Q141488.
- Q5198174 wikiPageWikiLink Q1415372.
- Q5198174 wikiPageWikiLink Q1709878.
- Q5198174 wikiPageWikiLink Q192161.
- Q5198174 wikiPageWikiLink Q2003238.
- Q5198174 wikiPageWikiLink Q215206.
- Q5198174 wikiPageWikiLink Q230655.
- Q5198174 wikiPageWikiLink Q3406706.
- Q5198174 wikiPageWikiLink Q36161.
- Q5198174 wikiPageWikiLink Q45715.
- Q5198174 wikiPageWikiLink Q4650736.
- Q5198174 wikiPageWikiLink Q5121616.
- Q5198174 wikiPageWikiLink Q512604.
- Q5198174 wikiPageWikiLink Q515375.
- Q5198174 wikiPageWikiLink Q600590.
- Q5198174 wikiPageWikiLink Q6049376.
- Q5198174 wikiPageWikiLink Q617295.
- Q5198174 wikiPageWikiLink Q621751.
- Q5198174 wikiPageWikiLink Q638934.
- Q5198174 wikiPageWikiLink Q6465283.
- Q5198174 wikiPageWikiLink Q670834.
- Q5198174 wikiPageWikiLink Q6837611.
- Q5198174 wikiPageWikiLink Q6997812.
- Q5198174 wikiPageWikiLink Q7022818.
- Q5198174 wikiPageWikiLink Q752532.
- Q5198174 wikiPageWikiLink Q7837500.
- Q5198174 wikiPageWikiLink Q8078.
- Q5198174 wikiPageWikiLink Q837518.
- Q5198174 wikiPageWikiLink Q92672.
- Q5198174 comment "In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close adigraph is to a directed acyclic graph (DAG), in the sense that a DAG hascycle rank zero, while a complete digraph of order n with a self-loop ateach vertex has cycle rank n. The cycle rank of a directed graph is closely related to the tree-depth of an undirected graph and to the star height of a regular language.".
- Q5198174 label "Cycle rank".