Width parameters beyond tree-width and their applications
Besides the very successful concept of tree-width (see [Bodlaender, H. and Koster, A.(2007)
Combinatorial optimisation on graphs of bounded treewidth. These are special issues on …
Combinatorial optimisation on graphs of bounded treewidth. These are special issues on …
Fast FPT-approximation of branchwidth
FV Fomin, T Korhonen - Proceedings of the 54th Annual ACM SIGACT …, 2022 - dl.acm.org
Branchwidth determines how graphs, and more generally, arbitrary connectivity (basically
symmetric and submodular) functions could be decomposed into a tree-like structure by …
symmetric and submodular) functions could be decomposed into a tree-like structure by …
[HTML][HTML] A simple linear time algorithm for cograph recognition
In this paper, we describe a new simple linear time algorithm to recognize cographs.
Cographs are exactly the P4-free graphs (where P4 denotes the path with 4 vertices). The …
Cographs are exactly the P4-free graphs (where P4 denotes the path with 4 vertices). The …
[HTML][HTML] Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
E Gioan, C Paul - Discrete Applied Mathematics, 2012 - Elsevier
In this paper, we revisit the split decomposition of graphs and give new combinatorial and
algorithmic results for the class of totally decomposable graphs, also known as the distance …
algorithmic results for the class of totally decomposable graphs, also known as the distance …
[HTML][HTML] Total dominating sequences in trees, split graphs, and under modular decomposition
A sequence of vertices in a graph G with no isolated vertices is called a total dominating
sequence if every vertex in the sequence totally dominates at least one vertex that was not …
sequence if every vertex in the sequence totally dominates at least one vertex that was not …
[HTML][HTML] From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats
M Hellmuth, GE Scholz - Discrete Applied Mathematics, 2022 - Elsevier
The modular decomposition of a graph G is a natural construction to capture key features of
G in terms of a labeled tree (T, t) whose vertices are labeled as “series”(1),“parallel”(0) or …
G in terms of a labeled tree (T, t) whose vertices are labeled as “series”(1),“parallel”(0) or …
Delta-confluent drawings
D Eppstein, MT Goodrich, JY Meng - International Symposium on Graph …, 2005 - Springer
LNCS 3843 - Delta-Confluent Drawings Page 1 Delta-Confluent Drawings⋆ David Eppstein,
Michael T. Goodrich, and Jeremy Yu Meng School of Information and Computer Science …
Michael T. Goodrich, and Jeremy Yu Meng School of Information and Computer Science …
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
A Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once.
A Hamiltonian cycle of a graph is a simple cycle with the same property. The Hamiltonian …
A Hamiltonian cycle of a graph is a simple cycle with the same property. The Hamiltonian …
[图书][B] Clustering social networks using distance-preserving subgraphs
R Nussbaum, AH Esfahanian, PN Tan - 2013 - Springer
Cluster analysis describes the division of a dataset into subsets of related objects, which are
usually disjoint. There is considerable variety among the different types of clustering …
usually disjoint. There is considerable variety among the different types of clustering …
[HTML][HTML] Laminar structure of ptolemaic graphs with applications
R Uehara, Y Uno - Discrete applied mathematics, 2009 - Elsevier
Ptolemaic graphs are those satisfying the Ptolemaic inequality for any four vertices. The
graph class coincides with the intersection of chordal graphs and distance hereditary …
graph class coincides with the intersection of chordal graphs and distance hereditary …