Rooted Cycle Bases

DOI10.1007/978-3-319-21840-3_28zbMath1451.05228MaRDI QIDQ3449832

J. Michael McCarthy, David Eppstein, Brian E. Parrish

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_28

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Cites Work

• Unnamed Item
• Unnamed Item
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Minimum weakly fundamental cycle bases are hard to find
• Improved cycle bases for the flexibility analysis of structures
• Symbolic processing of multiloop mechanism dynamics using closed-form kinematics solutions
• New length bounds for cycle bases
• On the 2-factors of bicubic graphs
• Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Exploratory Projection Pursuit
• Multiresolution Approximations and Wavelet Orthonormal Bases of L 2 (R)
• Periodic Timetable Optimization in Public Transport
• When graph theory helps self-stabilization
• Depth-First Search and Linear Graph Algorithms