Between O(nm) and O(nα)

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 709-716

  Kratsch, Dieter ^a   Spinrad, Jeremy ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

NEIGHBORHOOD DELETED COMPONENTS; PERIODIC MATRIX MULTIPLICATION;

GRAPH THEORY;

EID: 0037739900     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. S.R. Arikati, C.P. Rangan, An Efficient Algorithm for Finding a Two-Pair, and its Applications, Discr. Appl. Mathematics 31, 71-74, 1991
2. A. Brandstädt, V.B. Le, J. Spinrad, Graph Classes: A Survey, SIAM, Philadelphia, 1999
3. V. Chvátal, Star-Cutsets and Perfect Graphs, J. Comb. Theory, Ser. B 39, 189-199, 1985
4. D. Coppersmith, S. Winograd, Matrix Multiplication via Arithmetic Progressions, J. Symbolic Computing 9, 251-280, 1999
5. D.G. Corneil, S. Olariu, L. Stewart, Asteroidal Triple-free Graphs, SIAM J. Discr. Math. 10, 399-430, 1971
6. D.G. Corneil, S. Olariu, L. Stewart, Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs, SIAM J. Comput. 28, 1284-1297, 1999
7. T. Gallai, Transitiv orientbare Graphen, Acta Math. Acad. Sci. Hungar. 18, 25-66, 1967
8. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980
9. R.B. Hayward, Weakly triangulated graphs, J. Comb. Theory, Ser. B 39, 200-208, 1985
10. X. Huang, V.Y. Pan, Fast Rectangular Matrix Multiplication and Applications, Journal of Complexity 14, 257-299, 1998
11. D. Kelly, Comparability Graphs, Graphs and Order, NATO Adv. Sci. Inst. Ser. C Math Phys. Sci. 147, ed. I. Rival, Reidel, Dordrecht, 3-40, 1985
12. E. Köhler, Recognizing Graphs without Asteroidal Triples, WG 2000, Lect. Notes Comput. Sci. 1928, Springer, Berlin, 255-266, 2000
13. C.G. Lekkerkerker, J. Ch. Boland, Representation of a Finite Graph by a Set of Intervals on the Real Line, Fund. Math. 51, 45-64, 1962/1963
14. R.H. Möhring, Triangulating Graphs without Asteroidal Triples, Discr. Appl. Mathematics 64, 281-287, 1996
15. R. E. Tarjan, Decomposition by Clique Separators, Discr. Mathematics 55, 221-232, 1985
16. M. Thorup, Decremental Dynamic Connectivity, J. Algorithms 33, 229-243, 1999
17. S.H. Whitesides, An Algorithm for Finding Clique Cut-Sets, Inf. Proc. Lett. 12, 31-32, 1981