From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
type: Item
instance of: scholarly article
title: From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
zbMATH Open document ID: 1497.05218
author: Marc Hellmuth
author: G. E. Scholz
published in: Discrete Applied Mathematics
publication date: 2022-09-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/2112.05537
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 7585587
zbMATH Keywords: cographs
zbMATH Keywords: modular decomposition
zbMATH Keywords: prime modules
zbMATH Keywords: recognition algorithms
zbMATH Keywords: prime vertex replacement
zbMATH Keywords: phylogenetic networks
zbMATH Keywords: galled tree
MaRDI profile type: Publication
OpenAlex ID: W4284966016
Wikidata QID: Q114191413
arXiv ID: 2112.05537
cites work: A lower bound on the tree-width of graphs with irrelevant vertices
cites work: A canonical decomposition theory for metrics on a finite set
cites work: Graphs with unique maximal clumpings
cites work: Recovering symbolically dated, rooted trees from symbolic ultrametrics
cites work: The Pathwidth and Treewidth of Cographs
cites work: On the minimum sum coloring of \(P_4\)-sparse graphs
cites work: Graph Classes: A Survey
cites work: On variations of \(P_{4}\)-sparse graphs
cites work: A Simple Linear Time LexBFS Cograph Recognition Algorithm
cites work: From modular decomposition trees to rooted median graphs
cites work: Computing the maximum agreement of phylogenetic networks
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Upper bounds to the clique width of graphs
cites work: Q4954442
cites work: Minimal indecomposable graphs
cites work: Q5678892
cites work: Efficient and practical algorithms for sequential modular decomposition
cites work: A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
cites work: On the number of vertices and edges of the Buneman graph
cites work: The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
cites work: An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
cites work: Primitivity is hereditary for 2-structures
cites work: Theory of 2-structures. I: Clans, basic subclasses, and morphisms
cites work: Theory of 2-structures. II: Representation through labeled tree families
cites work: Transitiv orientierbare Graphen
cites work: On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
cites work: The cluster deletion problem for cographs
cites work: Reconstructing gene trees from Fitch's xenology relation
cites work: Q3836509
cites work: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
cites work: Reconstructing unrooted phylogenetic trees from symbolic ternary metrics
cites work: Algorithm Theory - SWAT 2004
cites work: On the X-join decomposition for undirected graphs
cites work: A simple linear time algorithm for cograph recognition
cites work: A survey of the algorithmic aspects of modular decomposition
cites work: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
cites work: Cograph editing: Merging modules is equivalent to editing P_4s
cites work: Orthology relations, symbolic ultrametrics, and cographs
cites work: A short note on undirected Fitch graphs
cites work: Alternative characterizations of Fitch's xenology relation
cites work: The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
cites work: Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
cites work: The relation graph
cites work: Encoding and constructing 1-nested phylogenetic networks with trinets
cites work: Three-way symbolic tree-maps and ultrametrics
cites work: Beyond representing orthology relations by trees
cites work: Indecomposable graphs
cites work: Linear time algorithms for graph search and connectivity determination on complement graphs.
cites work: P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time
cites work: Orthology Relation and Gene Tree Correction: Complexity Results
cites work: An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
cites work: Q3128916
cites work: Modular decomposition and transitive orientation
cites work: Q4506382

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (cites work)
cites work: Incremental modular decomposition

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (cites work)
cites work: Q3683903

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (cites work)
cites work: Indirect identification of horizontal gene transfer

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (cites work)
cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (cites work)
cites work: On a property of the class of n-colorable graphs

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (cites work)
cites work: Phylogeny. Discrete and random processes in evolution

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (cites work)
cites work: Graphs indecomposable with respect to the X-join

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (cites work)
cites work: Dacey Graphs

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (cites work)
cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (DOI)
DOI: 10.1016/J.DAM.2022.06.042