Y. L. Lin and S. S. Skiena. Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics, 8(1):99--118, 1995. 1 Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Parallel Distance-k Coloring Algorithms for Numerical.. - Gebremedhin, Manne.. (Correct)
Fixed-Parameter Complexity of Lambda-Labelings - Fiala, Kloks, Kratochvil (1999) (Correct)
On Powers of Chordal Graphs And Their Colorings - Agnarsson, Greenlaw.. (2000) (1 citation) (Correct)
Coloring Powers of Planar Graphs - Agnarsson, Halldórsson (2000) (9 citations) (Correct)
On Powers of Chordal Graphs And Their Colorings - Agnarsson, Greenlaw.. (2000) (1 citation) (Correct)
Coloring Powers of Planar Graphs - Agnarsson, Halldórsson (2000) (9 citations) (Correct)
Approximating Disjoint-Path Problems Using Greedy.. - Kolliopoulos, Stein (1998) (26 citations) (Correct)
Computing Roots of Graphs is Hard - Rajeev Motwani, Madhu Sudan (1994) (7 citations) (Correct)
Error Compensation in Leaf Root Problems - Dom, Guo, Hüffner, Niedermeier (2004) (Correct)
Approximating Disjoint-Path Problems Using Packing Integer.. - Kolliopoulos, Stein (1998) (1 citation) (Correct)
Exact and Approximation Algorithms for Network Flow and.. - Kolliopoulos (1998) (2 citations) (Correct)
Graph Coloring in Optimization Revisited - Gebremedhin, Manne, Pothen (2002) (1 citation) (Correct)
Phylogenetic k-Root and Steiner k-Root - Lin, Kearney, Jiang Self-citation (Lin) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC