Asteroidal Triple-Free Graphs (1997)

by Derek G. Corneil , Stephan Olariu , Lorna Stewart
Citations:57 - 10 self

Documents Related by Co-Citation

12771 Computers and Intractability; A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
1274 Algorithmic Graph Theory and Perfect graphs – M C Golumbic - 1980
154 Representation of a finite graph by a set of intervals on a real line – C Lekkerkerker, J Boland - 1962
370 Complexity of finding embeddings in a k-tree – Stefan Arnborg, Derek G. Corneil , Andrzej Proskurowski - 1987
202 Computing the minimum fill-in is NP-complete – M Yannakakis - 1981
1050 Parameterized Complexity – Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen - 1998
561 Computer Solution of Large Sparse Positive Definite Systems – A George, J W Liu - 1981
271 Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs – R E Tarjan, M Yannakakis - 1984
527 Testing the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms – K Booth, G Lueker - 1976