Cycle bases in graphs characterization, algorithms, complexity, and applications
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 …
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 …
proper set of definitions and differential operators that make it possible to operate the …
Sparse pose graph optimization in cycle space
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 …
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
Networks play a central role today, since many aspects of information technology like
communication, mobility, and transport are based on networks. Social interactions and …
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 …
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 …
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
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 …
m edges and n vertices. The edges of G have non-negative weights on them. The previous …
Minimum cycle bases for network graphs
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 …
length basis of its cycle vector space. A well-known algorithm by Horton of 1987 needs …
Computing symmetry groups of polyhedra
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 …
as well as for practical polyhedral computations. In this note, we study symmetry groups …
Minimum cycle bases: Faster and simpler
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 …
undirected (or directed) graph G with m edges, n vertices and nonnegative edge weights. In …