Narayan Vikas

Available identifiers

Publication	Date of Publication	Type
Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon	2020-05-26	Paper
Computational complexity relationship between compaction, vertex-compaction, and retraction	2019-01-18	Paper
Computational complexity relationship between compaction, vertex-compaction, and retraction	2018-06-15	Paper
Algorithms for partition of some class of graphs under compaction and vertex-compaction	2013-11-11	Paper
Algorithms for partition of some class of graphs under compaction	2011-08-17	Paper
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results	2005-12-07	Paper
Computing and Combinatorics	2005-06-15	Paper
Compaction, Retraction, and Constraint Satisfaction	2005-02-21	Paper
Computational complexity of compaction to irreflexive cycles	2004-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4414515	2003-07-25	Paper
Computational Complexity of Compaction to Reflexive Cycles	2003-06-19	Paper
https://portal.mardi4nfdi.de/entity/Q4252439	2000-01-25	Paper
An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism	1996-11-27	Paper

This page was built for person: Narayan Vikas