A linear-time algorithm to compute a MAD tree of an interval graph

Author： Dahlhaus E.   Dankelmann P.   Ravi R.  

Publisher： Elsevier

ISSN： 0020-0190

Source： Information Processing Letters, Vol.89, Iss.5, 2004-03, pp. : 255-259

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem

By Bonizzoni Paola  

Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. : 267-285

Springer Publishing Company

Access to resources Recommend Favorite

Designing a novel linear‐time graph kernel for semantic link network

By  

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 1532-0626, Iss. 15, 2015-10 ,pp. : 4039-4052

John Wiley & Sons Inc

Access to resources Recommend Favorite

Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations

By Alam M.  

Algorithmica, Vol. 67, Iss. 1, 2013-09 ,pp. : 3-22

Springer Publishing Company

Access to resources Recommend Favorite

Designing a novel linear‐time graph kernel for semantic link network

By  

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 15, 2015-10 ,pp. : 4039-4052

John Wiley & Sons Inc

Access to resources Recommend Favorite

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D.   Slutzki G.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite