Cycle bases in graphs characterization, algorithms, complexity, and applications

T Kavitha, C Liebchen, K Mehlhorn, D Michail… - Computer Science …, 2009 - Elsevier
Cycles in graphs play an important role in many applications, eg, analysis of electrical
networks, analysis of chemical and biological pathways, periodic scheduling, and graph …

[書籍][B] Discrete calculus: Applied analysis on graphs for computational science

LJ Grady, JR Polimeni - 2010 - Springer
The field of discrete calculus, also known as" discrete exterior calculus", focuses on finding a
proper set of definitions and differential operators that make it possible to operate the …

Sparse pose graph optimization in cycle space

F Bai, T Vidal-Calleja, G Grisetti - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
The state-of-the-art modern pose-graph optimization (PGO) systems are vertex based. In this
context, the number of variables might be high, albeit the number of cycles in the graph (loop …

[書籍][B] Algorithmics of large and complex networks: design, analysis, and simulation

J Lerner, D Wagner, K Zweig - 2009 - Springer
Networks play a central role today, since many aspects of information technology like
communication, mobility, and transport are based on networks. Social interactions and …

[HTML][HTML] Classes of cycle bases

C Liebchen, R Rizzi - Discrete Applied Mathematics, 2007 - Elsevier
In the last years, new variants of the minimum cycle basis (MCB) problem and new classes
of cycle bases have been introduced, as motivated by several applications from disparate …

[HTML][HTML] Integral cycle bases for cyclic timetabling

C Liebchen, L Peeters - Discrete Optimization, 2009 - Elsevier
Cyclic railway timetables are typically modeled by a constraint graph G with a cycle period
time T, in which a periodic tension x in G corresponds to a cyclic timetable. In this model, the …

A faster algorithm for minimum cycle basis of graphs

T Kavitha, K Mehlhorn, D Michail, K Paluch - Automata, Languages and …, 2004 - Springer
In this paper we consider the problem of computing a minimum cycle basis in a graph G with
m edges and n vertices. The edges of G have non-negative weights on them. The previous …

Minimum cycle bases for network graphs

F Berger, P Gritzmann, S de Vries - Algorithmica, 2004 - Springer
The minimum cycle basis problem in a graph G=(V, E) is the task to construct a minimum
length basis of its cycle vector space. A well-known algorithm by Horton of 1987 needs …

Computing symmetry groups of polyhedra

D Bremner, MD Sikirić, DV Pasechnik… - LMS Journal of …, 2014 - cambridge.org
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure
as well as for practical polyhedral computations. In this note, we study symmetry groups …

Minimum cycle bases: Faster and simpler

K Mehlhorn, D Michail - ACM Transactions on Algorithms (TALG), 2009 - dl.acm.org
We consider the problem of computing exact or approximate minimum cycle bases of an
undirected (or directed) graph G with m edges, n vertices and nonnegative edge weights. In …