π
π
The Cartographer
Linear MIM-Width of Trees
July 09, 2019 Β· Declared Dead Β· π International Workshop on Graph-Theoretic Concepts in Computer Science
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Svein HΓΈgemo, Jan Arne Telle, Erlend Raa VΓ₯gset
arXiv ID
1907.04132
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CC
Citations
10
Venue
International Workshop on Graph-Theoretic Concepts in Computer Science
Last Checked
4 months ago
Abstract
We provide an $O(n \log n)$ algorithm computing the linear maximum induced matching width of a tree and an optimal layout.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted