Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number

@article{Felsner2003RecognitionAF,
  title={Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number},
  author={Stefan Felsner and Vijay Raghavan and Jeremy P. Spinrad},
  journal={Order},
  year={2003},
  volume={20},
  pages={351-364}
}
Partially ordered sets of small width and graphs of small Dilworth number have many interesting properties and have been well studied. Here we show that recognition of such orders and graphs can be done more efficiently than by using the well-known algorithms based on bipartite matching and matrix multiplication. In particular, we show that deciding deciding if an order has width k can be done in O(kn2) time and whether a graph has Dilworth number k can be done in O(k2n2) time.For very small k… 
Graph Classes with Structured Neighborhoods and Algorithmic Applications
TLDR
This paper studies graph classes for which a decomposition of logarithmic boolean-width is computed, and shows that these decompositions have boolean- width O(logn), which implies that a large class of vertex subset and vertex partitioning problems can be solved in polynomial time on these graph classes.
Nested colourings of graphs
A proper vertex colouring of a graph is \emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered
Graph Classes with Structured Neighborhoods and
Given a graph in any of the following graph classes: trapezoid graphs, circular permutation graphs, convex graphs, Dilworth k graphs, k-polygon graphs, circular arc graphs and complements of
On Dilworth k Graphs and Their Pairwise Compatibility
TLDR
This paper gives a new characterization of Dilworth k graphs, for each value of k, exactly defining their structure and puts these graphs in relation with pairwise compatibility graphs (PCGs), i.e. graphs on n nodes that can be generated from an edge-weighted tree T that has n leaves.
Nested colorings of graphs
  • D. Cook
  • Mathematics, Computer Science
    Australas. J Comb.
  • 2015
TLDR
A new upper bound is developed for the nested chromatic number of a finite simple graph, which can be computed in polynomial time, unlike the standard Chromatic number which is NP -hard.
New Width Parameters of Graphs
TLDR
The notion of branch decompositions of a set function introduced by Robert-son and Seymour is used to introduce three new graph parameters, boolean-width, max-imum matching-width (MM-width) and maximum induced matching- width (MIM-width), which are compared to existing graph parameters by comparing partial orders of width parameters.
On the parameterized complexity of the Minimum Path Cover problem in DAGs
TLDR
An algorithm based on the notion of frontier antichains, generalizing the standard notion of right-most maximum antichain of a directed acyclic graph, which is faster than all existing MPC algorithms and shows that some basic problems on DAGs get faster algorithms as immediate corollaries of this result.
On pairwise compatibility graphs having Dilworth number two
Computing a minimal partition of partial orders into heapable subsets
TLDR
A characterization result reminiscent of the proof of Dilworth's theorem is proved, which yields as a byproduct a flow-based algorithm for computing such a minimal decomposition of sets and sequences of intervals.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
A note on perfect orders
Threshold characterization of graphs with dilworth number two
TLDR
It is shown that finite simple graphs G = (V, E), where V is the vertex set of G and E a subset of pairs of G are precisely the graphs with Dilworth number at most two.
Randomized $\tilde{O}(M(
TLDR
A randomized (Las Vegas) algorithm is given for finding the Gallai--Edmonds decomposition of a graph that is significantly better than the best previous ones, e.g., using the best value of M(n) currently known, the new sequential running time is O(n2.5 /(log n) or more.
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n)
Linear-time transitive orientation
TLDR
An O(n + m) algorithm for the transitive orientation problem is described, where n and m are the number of vertices and edges of the graph, which gives linear time bounds for maximum clique and minimum vertex coloring on comparability graphs.
Algorithms for maximum k-colorings and k-coverings of transitive graphs
TLDR
The present paper contains polynomial time algorithms for finding maximum k-colorings andmaximum k-coverings of transitive graphs.
Algorithmic graph theory and perfect graphs
Minimizing setups in ordered sets of fixed width
TLDR
A simply polynomial time algorithm is given for computing the setup number, or jump number, of an ordered set with fixed width for solving a more general weighted problem in precedence constrained scheduling.
...
1
2
3
...