Computational complexity of compaction to cycles

Authors:
Narayan Vikas
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, British Columbia, Canada V5A 1S6
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Complexity of graph partition problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Connected and Loosely Connected List Homomorphisms

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Computational complexity of compaction to irreflexive cycles

Journal of Computer and System Sciences
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results

Journal of Computer and System Sciences
Algorithms for partition of some class of graphs under compaction

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics

Hi-index	0.00