English

Linear MIM-Width of Trees

Data Structures and Algorithms 2019-07-10 v1 Computational Complexity
Authors: Svein Høgemo , Jan Arne Telle , Erlend Raa Vågset
View on arXiv ↗ PDF ↗

Abstract

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

Keywords

decision tree graph algorithm succinct data structure

Cite

@article{arxiv.1907.04132,
  title  = {Linear MIM-Width of Trees},
  author = {Svein Høgemo and Jan Arne Telle and Erlend Raa Vågset},
  journal= {arXiv preprint arXiv:1907.04132},
  year   = {2019}
}

Comments

19 pages, 7 figures, full version of WG19 paper of same name

Related papers

View all related →
Data Structures and Algorithms · Computer Science
An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree
Manoj Gupta, Ankit Sharma
2009-01-20
Data Structures and Algorithms · Computer Science
Almost optimal algorithms for diameter-optimally augmenting trees
Davide Bilò
2018-10-03
Data Structures and Algorithms · Computer Science
An $O(n \log n)$ time Algorithm for computing the Path-length Distance between Trees
David Bryant, Celine Scornavacca
2018-11-05
Computational Geometry · Computer Science
Optimum-width upward drawings of trees
Therese Biedl
2015-11-05
Data Structures and Algorithms · Computer Science
A Linear-time Algorithm for Integral Multiterminal Flows in Trees
Mingyu Xiao, Hiroshi Nagamochi
2016-11-29
Data Structures and Algorithms · Computer Science
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch +2
2015-09-16
Artificial Intelligence · Computer Science
Advances in Learning Bayesian Networks of Bounded Treewidth
Siqi Nie, Denis Deratani Maua, Cassio Polpo de Campos, Qiang Ji
2014-06-09
Quantum Physics · Physics
Quantum Algorithms for Evaluating MIN-MAX Trees
Richard Cleve, Dmytro Gavinsky, David L. Yonge-Mallo
2022-03-29
Machine Learning · Computer Science
Optimal Mixed Integer Linear Optimization Trained Multivariate Classification Trees
Brandon Alston, Illya V. Hicks
2024-08-05
Computational Geometry · Computer Science
Linear Time Approximation Schemes for Geometric Maximum Coverage
Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang
2015-05-12
Data Structures and Algorithms · Computer Science
A O(c^k n) 5-Approximation Algorithm for Treewidth
Hans Bodlaender, Pål G. Drange, Markus S. Dregi, Fedor V. Fomin +2
2013-04-24
Machine Learning · Statistics
Maximum Margin Interval Trees
Alexandre Drouin, Toby Dylan Hocking, François Laviolette
2017-10-30
Distributed, Parallel, and Cluster Computing · Computer Science
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond
Mohsen Ghaffari, Christoph Grunau, Ce Jin
2020-08-11
Data Structures and Algorithms · Computer Science
On the thinness of trees
Flavia Bonomo-Braberman, Eric Brandwein, Carolina Lucía González, Agustín Sansone
2025-01-23
Combinatorics · Mathematics
The number of maximum matchings in a tree
Clemens Heuberger, Stephan Wagner
2013-04-09
Computational Geometry · Computer Science
An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2013-05-02
Data Structures and Algorithms · Computer Science
Tree Embedding in High Dimensions: Dynamic and Massively Parallel
Gramoz Goranci, Shaofeng H. -C. Jiang, Peter Kiss, Qihao Kong +2
2026-01-13
Combinatorics · Mathematics
A Graph-Matching Formulation of the Interleaving Distance between Merge Trees
Matteo Pegoraro
2024-11-11
Machine Learning · Computer Science
Mixed integer linear optimization formulations for learning optimal binary classification trees
Brandon Alston, Hamidreza Validi, Illya V. Hicks
2023-07-11
Optimization and Control · Mathematics
LP approximations to mixed-integer polynomial optimization problems
Daniel Bienstock, Gonzalo Munoz
2016-10-20
Data Structures and Algorithms · Computer Science
Optimal Algorithm to Reconstruct a Tree from a Subtree Distance
Takanori Maehara, Kazutoshi Ando
2019-02-26
Data Analysis, Statistics and Probability · Physics
The scaling of the minimum sum of edge lengths in uniformly random trees
Juan Luis Esteban, Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez
2017-12-14
Discrete Mathematics · Computer Science
Computing Rooted and Unrooted Maximum Consistent Supertrees
Leo van Iersel, Matthias Mnich
2010-05-31
Data Structures and Algorithms · Computer Science
Dispersion on Trees
Paweł Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann
2017-06-29
Data Structures and Algorithms · Computer Science
A Single-Exponential Time 2-Approximation Algorithm for Treewidth
Tuukka Korhonen
2023-08-24
R2 v1 2026-06-23T10:16:03.421Z