Yaw-Ling Lin, Steven S. Skiena  Home/Search
Context Related
Links: ACM DBLP | sunysb.edu/~skiena/papers/sqrt.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sunysb.edu/~skiena/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The n-th power (n 1) of a graph G = (V; E), written G n , is defined to be the graph having V as its vertex set with two vertices u; v adjacent in G n if and only if there exists a path of length at most n between them. Similarly, graph H has an n-th root G if G n = H . For the case of n = 2, we say that G 2 is the square of G and G is the square root of G 2 . Here we give a linear time algorithm for finding the tree square roots of a given graph and a linear time algorithm for... (Update)
Context of citations to this paper: More
...to the D coloring problem. 4 3 Parallel Coloring Algorithms The distance k coloring problem is NP hard for any fixed integer k [12]. A proof sketch showing that D coloring is NP hard is given in [2] Furthermore, Lexicographically First # 1 Coloring (LFC) the polynomial...
Cited by: More
Error Compensation in Leaf Root Problems - Dom, Guo, Hüffner, Niedermeier (2004) (Correct)
Approximating Disjoint-Path Problems Using Packing Integer.. - Kolliopoulos, Stein (1998) (Correct)
Exact and Approximation Algorithms for Network Flow and.. - Kolliopoulos (1998) (Correct)
Active bibliography (related documents): More All
1.9: Computing Roots of Graphs is Hard - Rajeev Motwani, Madhu Sudan (1994) (Correct)
0.5: An on-Line Incremental Approach for Dynamically.. - Berry, Heggernes.. (2003) (Correct)
0.5: n-Extendability of Line Graphs, Power Graphs, and Total Graphs - Holton, al. (Correct)
Similar documents based on text: More All
0.2: Recognizing Small Subgraphs - Sundaram, Skiena (1995) (Correct)
0.1: Machine Learning In Computer Chess: The Next Generation - Fürnkranz (1996) (Correct)
0.1: A Case Study in Genome-Level Fragment Assembly - Chen, Skiena (2000) (Correct)
Related documents from co-citation: More All
4: The square of every two-connected graph is Hamiltonian (context) - Fleischner - 1974
4: Optimal approximation of sparse Hessians and its equivalence to a graph coloring.. (context) - McCormick - 1983
4: Journal of Algorithms (context) - Corneil, Kearney - 1998
BibTeX entry: (Update)
Y-L. Lin and S.S. Skiena, "Algorithms for Square Roots of Graphs," Technical Report TR# 91/11, Department of Computer Science, SUNY Stony Brook, 1991. http://citeseer.ist.psu.edu/126574.html More
@inproceedings{ lin91algorithms,
author = "Lin and Skiena",
title = "Algorithms for Square Roots of Graphs",
booktitle = "{ISAAC}: 2nd International Symposium on Algorithms and Computation (formerly {SIGAL} International Symposium on Algorithms), Organized by Special Interest Group on Algorithms ({SIGAL}) of the Information Processing Society of Japan ({IPSJ}) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers ({IEICE}))",
year = "1991",
url = "citeseer.ist.psu.edu/126574.html" }
Citations (may not include all citations):4212 Computers and Intractability -- A Guide to the Theory of NP-.. (context) - Garey, Johnson - 1979
488 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
474 Graph Theory (context) - Harary - 1972 ACM
405 Depth-first search and linear graph algorithms (context) - Tarjan - 1972
308 Matrix multiplication via arithmetic progressions (context) - Coppersmith, Winograd - 1987 ACM DBLP
178 Algorithmic aspects of vertex elimination of graphs (context) - Rose, Tarjan et al. - 1976
97 Incidence matrices and interval graphs (context) - Fulkerson, Gross - 1965
90 On rigid circuit graphs (context) - Dirac - 1961
77 Dividing a graph into triconnected components (context) - Hopcroft, Tarjan - 1973 DBLP
62 The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972 DBLP
59 Representation of a finite graph by a set of intervals on th.. (context) - Lekkerkerker, Ch - 1962
53 The intersection graphs of subtrees in trees are exactly the.. (context) - Gavril - 1974
42 A characterization of rigid circuit graphs (context) - Buneman - 1974
28 University of Toronto Press (context) - Tutte, Graphs - 1966
20 an ordering of the set of vertices of a connected graph (context) - Sekanina - 1960
12 The square of every two-connected graph is Hamiltonian (context) - Fleischner - 1974
9 Trees with hamiltonian square (context) - Harary, Schwenk - 1971
4 On graphs with Hamiltonian squares (context) - Underground - 1978
3 The square root of a graph (context) - Mukhopadhyay - 1967
2 path graphs and of graphs having nth root (context) - Escalante, Montejano et al. - 1974
2 A criterion for planarity of the square of a graph (context) - Harary, Karp et al. - 1967
2 A criterion for the planarity of a total graph (context) - Behzad - 1967
2 The square root of a digraph (context) - Geller - 1968
2 Representations of rigid cycle graphs (context) - Walter - 1972
1 A recognition algorithms for the total graph (context) - Gavril - 1978
1 The total group of a graph (context) - Behzad, Radjavi - 1968
1 Bell System Tech (context) - Ross, Harary et al. - 1960
1 Square is NP-complete (context) - Motwani, Sudan - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.sunysb.edu/~skiena/papers.html): More
Sorting with Fixed-Length Reversals - Chen, Skiena (1995) (Correct)
Unification Factoring for Efficient Execution of.. - Dawson.. (1995) (Correct)
Reconstructing Strings from Substrings - Skiena, Sundaram (1993) (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