Abstract. 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 e��ciently 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(kn 2) time and whether a graph has Dilworth number k can be done in O(k
|
6327
|
Introduction to algorithms
– Cormen, Leiserson, et al.
- 1990
|
|
929
|
Graph Theory with applications
– Bondy, Murty
- 1976
|
|
890
|
Algorithmic Graph Theory and Perfect Graphs
– Golumbic
- 1980
|
|
543
|
Matrix multiplication via arithmetic progressions
– Coppersmith, Winograd
- 1990
|
|
535
|
Data Structures and Network Algorithms
– Tarjan
- 1983
|
|
389
|
An n 5/2 algorithm for maximum matchings in bipartite graphs
– Hopcroft, Karp
- 1973
|
|
245
|
Gaussian Elimination is Not Optimal
– Strassen
- 1969
|
|
159
|
A decomposition theorem for partially ordered sets
– Dilworth
- 1950
|
|
98
|
Emde Boas. Preserving order in a forest in less than logarithmic time and linear space
– van
- 1977
|
|
40
|
On economic construction of the transitive closure of a directed graph
– Arlazarov, Dinic, et al.
- 1970
|
|
34
|
Computing a maximum cardinality matching in a bipartite graph
– Alt, Blum, et al.
- 1991
|
|
25
|
Aggregation of inequalities in integer programming
– CHVÁTAL, HAMMER
- 1977
|
|
23
|
Threshold Graphs and Related Topics
– Mahadev, Peled
- 1995
|
|
12
|
Scheduling Interval Ordered Tasks
– Papadimitriou, Yannakakis
- 1979
|
|
8
|
Randomized ~ O(M(jV j)) algorithms for problems in matching theory
– Cheriyan
- 1997
|
|
6
|
Set-packing and threshold graphs
– Chvátal, Hammer
- 1973
|
|
6
|
Some combinatorial problems on partially ordered sets
– Dilworth
- 1960
|
|
5
|
Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
– Sidney, Steiner
- 1986
|
|
4
|
Improved Diagnosability Algorithms
– Raghavan, Tripathi
- 1991
|
|
3
|
The Dilworth number of a graph
– Földes, Hammer
- 1978
|
|
3
|
Note on Dilworth's embedding theorem for partially ordered sets
– Fulkerson
- 1956
|
|
2
|
Linear time transitive orientation
– McConnell, Spinrad
- 1997
|
|
2
|
Polynomial algorithms to count linear extensions in certain posets
– Steiner
- 1990
|
|
1
|
Linear extensions of posets of bounded width
– Atkinson, Chang
- 1986
|
|
1
|
Threshold characterization of graphs with Dilworth number 2
– Benzaken, Hammer, et al.
- 1985
|
|
1
|
Split graphs of Dilworth number two
– Benzaken, Hammer, et al.
- 1985
|
|
1
|
Minimizing setups in ordered sets of width
– Colbourn, Pulleyblank
|
|
1
|
Characterization of quasitriangulated graphs
– Gorgos
|
|
1
|
A note on perfect orders
– Hoang, Mahadev
- 1989
|
|
