A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
DOI10.1007/S00453-014-9872-XzbMATH Open1328.68151OpenAlexW1999726696WikidataQ59404141 ScholiaQ59404141MaRDI QIDQ494803FDOQ494803
Authors: Yasuaki Kobayashi, Hisao Tamaki 
Publication date: 2 September 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-014-9872-x
Recommendations
- A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
- scientific article; zbMATH DE number 1974113
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
- Fixed parameter algorithms for one-sided crossing minimization revisited
- Graph Drawing
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Reducibility among combinatorial problems
- Aggregating inconsistent information: ranking and clustering
- Which problems have strongly exponential complexity?
- Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lower bounds based on the exponential time hypothesis
- On the complexity of \(k\)-SAT
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast FAST
- Edge crossings in drawings of bipartite graphs
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
- On the one-sided crossing minimization in a bipartite graph with large degrees
- An improved bound on the one-sided minimum crossing number in two-layered drawings
- A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
- Ranking and drawing in subexponential time
- Fixed parameter algorithms for one-sided crossing minimization revisited
Cited In (8)
- Title not available (Why is that?)
- A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
- A survey of parameterized algorithms and the complexity of edge modification
- The slotted online one-sided crossing minimization problem on 2-regular graphs
- Parameterized analysis and crossing minimization problems
- Graph Drawing
- Fixed parameter algorithms for one-sided crossing minimization revisited
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
This page was built for publication: A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494803)
