On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions (Q3196420): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1849163561 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1501.03931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of \(G\)-free colourability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of some classes of words avoiding two generalized patterns of length three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5404314 / 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: Finite automata and pattern avoidance in words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words restricted by patterns with at most 2 distinct letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Partitions of Graphs into Cographs and Stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthology relations, symbolic ultrametrics, and cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cograph Editing: Complexity and Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and parameterized algorithms for cograph editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of Vizing's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Superlinear Convergence of GMRES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3628998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Latest revision as of 00:18, 11 July 2024

scientific article
Language Label Description Also known as
English
On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions
scientific article

    Statements

    On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions (English)
    0 references
    0 references
    0 references
    29 October 2015
    0 references
    symbolic ultrametric
    0 references
    cograph
    0 references
    cotree
    0 references
    edge partition
    0 references
    NP-completeness
    0 references

    Identifiers