Publication:4252439
From MaRDI portal
zbMath0929.68093MaRDI QIDQ4252439
Publication date: 25 January 2000
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
Related Items
Algorithms for partition of some class of graphs under compaction and vertex-compaction, Computational complexity of compaction to irreflexive cycles, A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results