Dahlhaus E.

E. Dahlhaus

Information about the author E. Dahlhaus will soon be added to the site.
Found 1 papers in total
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
2000
A graph is distance hereditary if it preserves distances in all its connected induced...
Papers per page: