Publication:4386084
From MaRDI portal
zbMath0896.05055MaRDI QIDQ4386084
Nishit Kumar, James A. Parsons, Narsingh Deo
Publication date: 26 April 1998
regular graphs; NP-complete; perfect hash functions; cycle basis; sparse graphs; breadth-first search; fundamental cycles
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Lower bounds for strictly fundamental cycle bases in grid graphs, On the approximability of the minimum strictly fundamental cycle basis problem, Minimum cut bases in undirected networks, Integral cycle bases for cyclic timetabling, Edge-swapping algorithms for the minimum fundamental cycle basis problem, Algorithms for finding minimum fundamental cycle bases in graphs