Automata, Languages and Programming

DOI10.1007/b99859zbMath1103.05086OpenAlexW2505584480MaRDI QIDQ5466519

Telikepalli Kavitha, Katarzyna E. Paluch, Kurt Mehlhorn, Dimitrios Michail

Publication date: 24 August 2005

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

Full work available at URL: https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

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

Related Items

Length bounds for cycle bases of graphs, New length bounds for cycle bases, Matrix sparsification and the sparse null space problem, Classes of cycle bases, Minimum cycle bases of weighted outerplanar graphs, On a Special Co-cycle Basis of Graphs, Cycle bases in graphs characterization, algorithms, complexity, and applications, Minimum cycle bases of graphs on surfaces, The zoo of tree spanner problems, Minimum cut bases in undirected networks, Efficient approximation algorithms for shortest cycles in undirected graphs, Minimum path bases and relevant paths, Cycle bases of graphs and sampled manifolds, Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs, Integral cycle bases for cyclic timetabling, Edge-swapping algorithms for the minimum fundamental cycle basis problem, Minimum Cycle Bases and Their Applications, Minimum weakly fundamental cycle bases are hard to find, Properties of Gomory-Hu co-cycle bases, A Faster Algorithm to Update Betweenness Centrality After Node Alteration, A greedy approach to compute a minimum cycle basis of a directed graph