From modular decomposition trees to rooted median graphs (Q2074346): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2021.12.017 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4206554908 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2103.06683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and Geometry of Finite and Infinite Squaregraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A canonical decomposition theory for metrics on a finite set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering symbolically dated, rooted trees from symbolic ultrametrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Modular Decomposition of Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-uniform hypergraphs: modular decomposition and realization by tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise Compatibility Graphs: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic recognition algorithm and certificate for directed cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of vertices and edges of the Buneman graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental construction of 2-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of 2-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4492680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitivity is hereditary for 2-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of 2-structures. I: Clans, basic subclasses, and morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of 2-structures. II: Representation through labeled tree families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and complexity of uniformly nonprimitive labeled 2-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing gene trees from Fitch's xenology relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general algorithmic scheme for modular decompositions of hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cograph editing: Merging modules is equivalent to editing P_4s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthology relations, symbolic ultrametrics, and cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring phylogenetic trees from the knowledge of rare evolutionary events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative characterizations of Fitch's xenology relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relation graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Daisy cubes and distance cube polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On median graphs and median grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of median graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the tree realizability of a distance matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Daisy cubes: a characterization and a generalization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2021.12.017 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:29, 16 December 2024

scientific article
Language Label Description Also known as
English
From modular decomposition trees to rooted median graphs
scientific article

    Statements

    From modular decomposition trees to rooted median graphs (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2022
    0 references
    \(2\)-structures
    0 references
    symbolic ultrametrics
    0 references
    modular decomposition
    0 references
    prime module
    0 references
    prime vertex replacement
    0 references
    Median graph
    0 references
    algorithm
    0 references
    half-grid
    0 references
    hypercube
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references