On a Special Co-cycle Basis of Graphs

DOI10.1007/978-3-540-69903-3_31zbMath1155.05338OpenAlexW1550164786MaRDI QIDQ3512471

Telikepalli Kavitha

Publication date: 15 July 2008

Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_31

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items

Minimum cut bases in undirected networks

Cites Work

• Unnamed Item
• Unnamed Item
• Classes of cycle bases
• Minimum cut bases in undirected networks
• Integral cycle bases for cyclic timetabling
• Minimum weakly fundamental cycle bases are hard to find
• A greedy approach to compute a minimum cycle basis of a directed graph
• Minimal cycle bases of outerplanar graphs
• Minimum cycle bases for network graphs
• New length bounds for cycle bases
• Algorithms to compute minimum cycle basis in directed graphs
• Beyond the flow decomposition barrier
• Very Simple Methods for All Pairs Network Flow Analysis
• A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Multi-Terminal Network Flows
• On the Abstract Properties of Linear Dependence
• Automata, Languages and Programming
• Automata, Languages and Programming
• Algorithms - ESA 2003