scientific article; zbMATH DE number 1145916
From MaRDI portal
Publication:4386084
zbMath0896.05055MaRDI QIDQ4386084
Nishit Kumar, James A. Parsons, Narsingh Deo
Publication date: 26 April 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
regular graphsNP-completeperfect hash functionscycle basissparse graphsbreadth-first searchfundamental cycles
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
On the approximability of the minimum strictly fundamental cycle basis problem ⋮ Minimum cut bases in undirected networks ⋮ Lower bounds for strictly fundamental cycle bases in grid graphs ⋮ 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
This page was built for publication:
