Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number
From MaRDI portal
Publication:2150579
DOI10.1007/978-3-030-92681-6_43OpenAlexW4205180457MaRDI QIDQ2150579
Jingui Huang, Yixuan Li, Yunlong Liu
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_43
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-page book embeddings of 4-planar graphs
- Improved upper bounds for vertex cover
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
- Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis
- Exact crossing number parameterized by vertex cover
- Mixed linear layouts: complexity, heuristics, and experiments
- Parameterized algorithms for fixed-order book drawing with bounded number of crossings per edge
- Graph Layout Problems Parameterized by Vertex Cover
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Parameterized Complexity of 1-Planarity
- Mixed Linear Layouts of Planar Graphs
- Experimental Evaluation of Book Drawing Algorithms
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Parameterized Algorithms for Queue Layouts
- Upward Book Embeddings of st-Graphs
- Parameterized Algorithms for Book Embedding Problems
This page was built for publication: Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number
