scientific article; zbMATH DE number 1305547

zbMath0929.68093MaRDI QIDQ4252439

Narayan Vikas

Publication date: 25 January 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Coloring problems on bipartite graphs of small diameter ⋮ Computational complexity of compaction to irreflexive cycles ⋮ Algorithms for partition of some class of graphs under compaction and vertex-compaction ⋮ Computational complexity relationship between compaction, vertex-compaction, and retraction ⋮ On the subgraph epimorphism problem ⋮ A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results

This page was built for publication: