Results 31 to 40 of about 4,614 (253)
Train Marshalling Is Fixed Parameter Tractable [PDF]
, 2012 The train marshalling problem is about reordering the cars of a train using as few auxiliary rails as possible. The problem is known to be NP-complete. We show that it is fixed parameter tractable (FPT) with the number of auxiliary rails as parameter.
Leo Brueggeman +7 more
openaire +1 more source
The “Art of Trellis Decoding” Is Fixed-Parameter Tractable [PDF]
IEEE Transactions on Information Theory, 2017 50 pages. Accepted to SODA 2016 under the title "constructive algorithms for path-width of matroids". We added several figures to improve its presentation. We found a mistake in the proof of Lemma 3.24 of the previous version.
Jisu Jeong +2 more
openaire +3 more sources
Parameterized Algorithms for (r,l)-Partization
Journal of Graph Algorithms and Applications, 2013 We consider the (r,l)-Partization problem of finding a set of at most k vertices whose deletion results in a graph that can be partitioned into r independent sets and l cliques.
R. Krithika, N. Narayanaswamy
doaj +1 more source
Parameterized Complexity of 1-Planarity
Journal of Graph Algorithms and Applications, 2018 We consider the problem of drawing graphs with at most one crossing per edge. These drawings, and the graphs that can be drawn in this way, are called $1$-planar.
Michael Bannister +2 more
doaj +1 more source
Scheduling Meets Fixed-Parameter Tractability
CoRR, 2013 Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixed-parameter algorithms are appealing for many reasons, no such algorithms are known for many fundamental scheduling problems.
Matthias Mnich, Andreas Wiese
openaire +2 more sources
Treewidth of display graphs: bounds, brambles and applications
Journal of Graph Algorithms and Applications, 2019 Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or networks.
Remie Janssen +4 more
doaj +1 more source
Colored Hypergraph Isomorphism is Fixed Parameter Tractable [PDF]
Algorithmica, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arvind, V. +3 more
openaire +4 more sources
The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
Journal of Graph Algorithms and ApplicationsA $k$-edge-coloring of a graph is an assignment of colors $\{1,...,k\}$ to edges of the graph such that adjacent edges receive different colors. In the maximum $k$-edge-colorable subgraph problem we are given a graph and an integer $k$, the goal is to ...
Vahan Mkrtchyan
doaj +1 more source
Reconstructing Generalized Staircase Polygons with Uniform Step Length
Journal of Graph Algorithms and Applications, 2018 Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE).
Nodari Sitchinava, Darren Strash
doaj +1 more source
Deciding the Feasibility and Minimizing the Height of Tangles
Journal of Graph Algorithms and ApplicationsWe study the following combinatorial problem. Given a set of $n$ y-monotone Jordan curves, called wires, a tangle determines the order of the wires on a number of horizontal layers such that the orders of the wires on any two consecutive layers differ ...
Oksana Firman +5 more
doaj +1 more source