Least resolved trees for two-colored best match graphs (Q5084685): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.7155/jgaa.00564 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3200161862 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2101.07000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Graph Menagerie: Abstract Algebra and the Mad Veterinarian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating a random sink-free orientation in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented bipartite graphs and the Goldbach graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best match graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of 2-colored best match graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: ``Best match graphs'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best match graphs with binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete characterization of incorrect orthology assignments in best match graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of modification problems for best match graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Edge-Deletion Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7155/JGAA.00564 / rank
 
Normal rank

Latest revision as of 15:52, 30 December 2024

scientific article; zbMATH DE number 7549443
Language Label Description Also known as
English
Least resolved trees for two-colored best match graphs
scientific article; zbMATH DE number 7549443

    Statements

    Identifiers

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