AI Chat AI Image Generator AI Video Text to Speech

Linear MIM-Width of Trees

07/09/2019

∙

by Svein Høgemo, et al.

∙

∙

We provide an O(n log n) algorithm computing the linear maximum induced matching width of a tree and an optimal layout.

Svein Høgemo
4 publications
Jan Arne Telle
13 publications
Erlend Raa Vågset
4 publications

page 1

page 2

page 3

page 4

research

∙ 10/14/2017

Computing the maximum matching width is NP-hard

The maximum matching width is a graph width parameter that is defined on...

0 Kwangjun Ahn, et al. ∙

research

∙ 01/28/2020

Computing the Fréchet distance of trees and graphs of bounded tree width

We give algorithms to compute the Fréchet distance of trees and graphs w...

0 Maike Buchin, et al. ∙

research

∙ 05/08/2023

Shote note:Revisiting Linear Width: Rethinking the Relationship Between Single Ideal and Linear Obstacle

Linear-width is a well-known and highly regarded graph parameter. The co...

0 Takaaki Fujita, et al. ∙

research

∙ 05/29/2018

Rank Based Approach on Graphs with Structured Neighborhood

In this paper, we combine the rank-based approach and the neighbor-equiv...

0 Benjamin Bergougnoux, et al. ∙

research

∙ 07/19/2023

Radial Icicle Tree (RIT): Node Separation and Area Constancy

Icicles and sunbursts are two commonly-used visual representations of tr...

0 Yuanzhe Jin, et al. ∙

research

∙ 03/16/2021

Classification of OBDD size for monotone 2-CNFs

We introduce a new graph parameter called linear upper maximum induced m...

0 Igor Razgon, et al. ∙

research

∙ 08/21/2020

Optimal algorithm for computing Steiner 3-eccentricities of trees

The Steiner k-eccentricity of a vertex v of a graph G is the maximum Ste...

0 Aleksandar Ilic, et al. ∙