Asteroidal Triple-Free Graphs (1997)

Cached

Download Links

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

Active Bibliography

24 Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs – Derek G. Corneil, Stephan Olariu, Lorna Stewart - 1997
3 Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time – Derek G. Corneil, Stephan Olariu, Lorna Stewart - 1998
On the L(h, k)-Labeling of Co-Comparability Graphs ⋆ – Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi
Principles for Building Efficient Overlay Computers (AEOLUS). Most of the work – Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi
12 A Linear Time Algorithm to Compute a Dominating Path in an AT-free Graph – Derek G. Corneil, Stephan Olariu, Lorna Stewart - 1998
934 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995
2226 The capacity of wireless networks – Piyush Gupta, P. R. Kumar - 2000
653 Routing with Guaranteed Delivery in ad hoc Wireless Networks – Prosenjit Bose, Pat Morin, Ivan Stojmenović, Jorge Urrutia - 2001
4 On Linear and Circular Structure of (claw, net)-Free Graphs – Andreas Brandstädt, Feodor F. Dragan - 2003