Abstract | ||
---|---|---|
Minimum cycle bases of weighted undirected and directed graphs are bases of the cycle space of the (di)graphs with minimum weight. We survey the known polynomial-time algorithms for their construction, explain some of their properties and describe a few important applications. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1007/978-3-642-02094-0_2 | Algorithmics of Large and Complex Networks |
Keywords | Field | DocType |
cycle space,minimum cycle bases,important application,minimum weight,minimum cycle base,known polynomial-time algorithm,directed graph | Discrete mathematics,Linear independence,Combinatorics,Indifference graph,Tree-depth,Cycle basis,Chordal graph,Directed graph,Minimum weight,Cycle space,Mathematics | Conference |
Volume | ISSN | Citations |
5515 | 0302-9743 | 2 |
PageRank | References | Authors |
0.38 | 30 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Franziska Berger | 1 | 44 | 3.25 |
Peter Gritzmann | 2 | 412 | 46.93 |
Sven de Vries | 3 | 522 | 58.84 |