scientific article; zbMATH DE number 1145916

MaRDI QIDQ4386084zbMATH OpenFDO

Authors Narsingh Deo, Nishit Kumar, James A. Parsons

Publication date 26 April 1998

zbMATH Keywords

breadth-first searchcycle basisfundamental cyclesNP-completeperfect hash functionsregular graphssparse graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4010557
• Algorithms for finding minimum fundamental cycle bases in graphs
• The minimum fundamental cycle basic problem: a new heuristic based on edge swaps
• Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
• Experimental and Efficient Algorithms

Cited in

(8)

• 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
• scientific article; zbMATH DE number 4010557 (Why is no real title available?)
• The minimum fundamental cycle basic problem: a new heuristic based on edge swaps
• 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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386084)