Imagen de Portada

Minimum projective linearizations of trees in linear time

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Alemany-Puig, Lluís, Esteban, Juan Luis, Ferrer-i-Cancho, Ramon
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms Computation and Language Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On The Maximum Linear Arrangement Problem for Trees
por: Alemany-Puig, Lluís, et al.
Publicado: (2023)

Circle graphs can be recognized in linear time
por: Paul, Christophe, et al.
Publicado: (2025)

Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
por: Paul-Pena, Daniel, et al.
Publicado: (2025)

Identifying all snarls and superbubbles in linear-time, via a unified SPQR-tree framework
por: Sena, Francisco, et al.
Publicado: (2025)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
por: Korhonen, Tuukka, et al.
Publicado: (2024)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
por: Bernshteyn, Anton, et al.
Publicado: (2024)

Minimum Sum Set Cover: Structures and Algorithm
por: Zhang, Zhongyi, et al.
Publicado: (2026)

A logarithmic approximation of linearly ordered colourings
por: Håstad, Johan, et al.
Publicado: (2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
por: Foucaud, Florent, et al.
Publicado: (2025)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
por: Liu, Bowie, et al.
Publicado: (2025)

Quasi-linear distance query reconstruction for graphs of bounded treelength
por: Bastide, Paul, et al.
Publicado: (2024)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
por: Vroon, Mats, et al.
Publicado: (2025)

Finding Minimum Distance Preservers: A Parameterized Study
por: Simonov, Kirill, et al.
Publicado: (2026)

Generation of weighted trees, block trees and block graphs
por: Ekim, Tınaz, et al.
Publicado: (2024)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
por: DeHaan, Ian, et al.
Publicado: (2025)

Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
por: Yang, Puhan, et al.
Publicado: (2025)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
por: Hanaka, Tesshu, et al.
Publicado: (2023)

Terminal Steiner tree problem : Complexity and Algorithms
por: S, Jyothish, et al.
Publicado: (2026)

Using random spanning trees in survivable networks design
por: Wrobel, Blazej, et al.
Publicado: (2025)

Interdiction of minimum spanning trees and other matroid bases
por: Weninger, Noah, et al.
Publicado: (2024)

Semidefinite programming and linear equations vs. homomorphism problems
por: Ciardo, Lorenzo, et al.
Publicado: (2023)

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
por: Kita, Nanano
Publicado: (2025)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
por: Shakeri, Heman, et al.
Publicado: (2025)

Faster algorithms on linear delta-matroids
por: Koana, Tomohiro, et al.
Publicado: (2024)

Tight Paths and Tight Pairs in Weighted Directed Graphs
por: Balcázar, José Luis
Publicado: (2025)

Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
por: Berthe, Gaétan, et al.
Publicado: (2024)

Language Generation and Identification From Partial Enumeration: Tight Density Bounds and Topological Characterizations
por: Kleinberg, Jon, et al.
Publicado: (2025)

Grouping Strategies on Two-Phase Methods for Bi-objective Combinatorial Optimization
por: Mota, Felipe O., et al.
Publicado: (2025)

On the complexity of finding a spanning even tree in a graph
por: Hanaka, Tesshu, et al.
Publicado: (2024)

The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
por: Chen, Yeyuan
Publicado: (2024)

Solving the Multiobjective Quasi-Clique Problem
por: Santos, Daniela Scherer dos, et al.
Publicado: (2024)

On classes of bounded tree rank, their interpretations, and efficient sparsification
por: Gajarský, Jakub, et al.
Publicado: (2024)

Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
por: Chang, Yen-Hsiang, et al.
Publicado: (2025)

On a tree-based variant of bandwidth and forbidding simple topological minors
por: Jacob, Hugo, et al.
Publicado: (2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
por: Veldt, Nate, et al.
Publicado: (2025)

The expected sum of edge lengths in planar linearizations of trees. Theory and applications
por: Alemany-Puig, Lluís, et al.
Publicado: (2022)

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
por: Fici, Gabriele, et al.
Publicado: (2025)

Optimal hypersurface decision trees
por: He, Xi
Publicado: (2025)

Toward Minimum Graphic Parity Networks
por: Cao, Yixin, et al.
Publicado: (2025)