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

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 we have even better results. We show that orders of width at most 3 can be recognized in O(n) time and of width at most 4 in O(nlog n).

[1]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[2]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[3]  P. Hammer,et al.  The Dilworth Number of a Graph , 1978 .

[4]  George Steiner,et al.  Optimal Sequencing by Modular Decomposition: Polynomial Algorithms , 1986, Oper. Res..

[5]  Chính T. Hoàng,et al.  A note on perfect orders , 1989, Discret. Math..

[6]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[7]  N. Mahadev,et al.  Threshold graphs and related topics , 1995 .

[8]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[9]  V. Raghavan,et al.  Improved Diagnosability Algorithms , 1991, IEEE Trans. Computers.

[10]  Mihalis Yannakakis,et al.  Scheduling Interval-Ordered Tasks , 1979, SIAM J. Comput..

[11]  J. Cheriyan.  Randomized $\tilde{O}(M( , 1997 .

[12]  Kurt Mehlhorn,et al.  Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n) , 1991, Inf. Process. Lett..

[13]  P. Hammer,et al.  Aggregation of inequalities in integer programming. , 1975 .

[14]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[15]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[16]  Jeremy P. Spinrad,et al.  Linear-time transitive orientation , 1997, SODA '97.

[17]  Charles Payan.  Perfectness and dilworth number , 1983, Discret. Math..

[18]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[19]  Charles J. Colbourn,et al.  Minimizing setups in ordered sets of fixed width , 1985 .

[20]  Peter L. Hammer,et al.  Threshold characterization of graphs with dilworth number two , 1985, J. Graph Theory.

[21]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[22]  R. P. Dilworth.  Some Combinatorial Problems on Partially Ordered Sets , 1990 .

[23]  Peter van Emde Boas,et al.  Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..

[24]  Peter L. Hammer,et al.  Split graphs of Dilworth number 2 , 1985, Discret. Math..

[25]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[26]  Fanica Gavril,et al.  Algorithms for maximum k-colorings and k-coverings of transitive graphs , 1987, Networks.