ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
LBFS orderings and cocomparability graphs
Full text PdfPdf (227 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents
Baltimore, Maryland, United States
Pages: 883 - 884  
Year of Publication: 1999
ISBN:0-89871-434-6
Authors
Derek G. Corneil  Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada
Stephan Olariu  Department of Computer Science, Old Dominion University, Norfolk, VA
Lorna Stewart  Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2H1, Canada
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 26,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Derek G. Corneil , Stephan Olariu , Lorna Stewart, The ultimate interval graph recognition algorithm?, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.175-180, January 25-27, 1998, San Francisco, California, United States
 
2
Feodor F. Dragan , Falk Nicolai , Andreas Brandstädt, LexBFS-Orderings and Power of Graphs, Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, p.166-180, June 12-14, 1996
 
3
Dieter Kratsch , Lorna Stewart, Domination on cocomparability graphs, SIAM Journal on Discrete Mathematics, v.6 n.3, p.400-417, Aug. 1993  [doi>10.1137/0406032]
 
4
Stephan Olariu, An optimal greedy heuristic to color interval graphs, Information Processing Letters, v.37 n.1, p.21-25, Jan. 10, 1991  [doi>10.1016/0020-0190(91)90245-D]
 
5
D. 3. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266--283.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching; Computations on discrete structures


General Terms:
Algorithms, Design, Theory, Verification

Collaborative Colleagues:
Derek G. Corneil: colleagues
Stephan Olariu: colleagues
Lorna Stewart: colleagues

Peer to Peer - Readers of this Article have also read:
  • LR Parsing ACM Computing Surveys (CSUR)   6, 2
    A. V. Aho ,  S. C. Johnson


The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player