A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams (Q3656849): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1600949489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing (Complete) Binary Tanglegrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly bipartite graphs and the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Edge Deletions for Signed Graph Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Binary Tanglegrams: An Experimental Evaluation / rank
 
Normal rank

Latest revision as of 08:36, 2 July 2024

scientific article
Language Label Description Also known as
English
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
scientific article

    Statements

    Identifiers