The following pages link to Narayan Vikas (Q378211):
Displaying 13 items.
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- Computational complexity of compaction to irreflexive cycles (Q596309) (← links)
- An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism (Q1816737) (← links)
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (Q2575831) (← links)
- Algorithms for Partition of Some Class of Graphs under Compaction (Q3087960) (← links)
- (Q4252439) (← links)
- (Q4414515) (← links)
- Compaction, Retraction, and Constraint Satisfaction (Q4651492) (← links)
- Computing and Combinatorics (Q4681200) (← links)
- Computational Complexity of Compaction to Reflexive Cycles (Q4706192) (← links)
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
- Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915645) (← links)
- Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
