J. van Leeuwen  Home/Search
Context Related
| archive.cs.uu.nl/pub/RUU/...198617.pdf 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: cs.uu.nl/resear...EAR=&AUTH=&GRP= (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: known that the planarity of a graph can be tested by an algorithm that uses only O(n + e) steps, where n =1 V I and e =1 E I. The quest for algorithms of low complexity has lead to many intriguing problems in the study of graph algorithms. For example, no efficient, i.e., polynomial time algorithm is presently known for the graph layout problem discussed above. In fact, the MIN-CUT LINEAR ARRANGEMENT problem is known to be NP- complete. It is common in the theory of graph algorithms to... (Update)
Cited by: More
Fixed Parameter Algorithms for - Planar Dominating Set (2000) (Correct)
Attribute Value Reordering for Efficient Hybrid OLAP - Kaser, Lemire (2005) (Correct)
Fixed-Parameter Tractability and Completeness II: On.. - Downey, Fellows (1994) (Correct)
Active bibliography (related documents): More All
0.1: Frequent Subtree Mining - An Overview - Chi, Nijssen, Muntz, Kok (2005) (Correct)
0.1: Faster Subtree Isomorphism - Shamir, Tsur (1997) (Correct)
0.1: Algorithms for Graphs of (Locally) Bounded Treewidth - Hajiaghayi (2001) (Correct)
Similar documents based on text: More All
1.0: A Polynomial Time Algorithm for the Cutwidth of Bounded .. - Thilikos, Serna.. (2001) (Correct)
0.8: Cyclic Cutwidth of the Mesh - Schröder, Sykora, Vrto (1998) (Correct)
0.8: Cutwidth of the r-dimensional Mesh of d-ary Trees - Vrto (2001) (Correct)
Related documents from co-citation: More All
11: Fixed-parameter tractability and Completeness I: Basic Results - Downey, Fellows - 1995
10: Vertex cover: Further observations and further improvements - Chen, Kanj et al. - 1999
10: Treewidth: Algorithmic techniques and results - Bodlaender - 1998
BibTeX entry: (Update)
J. van Leeuwen, Graph algorithms, in: J. Van Leeuwen, ed., Handbook of theoretical computer science, vol. A: Algorithms and Complexity. (MIT Press, Cambridge, MA, 1990), 525-631. http://citeseer.ist.psu.edu/vanleeuwen86graph.html More
@incollection{ vanleeuwen90graph,
author = "Jan van Leeuwen",
title = "Graph Algorithms",
booktitle = "Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)",
pages = "525-631",
year = "1990",
url = "citeseer.ist.psu.edu/vanleeuwen86graph.html" }
Citations (may not include all citations):9 Isomorphism testing for graphs of bounded genus (context) - Miller - 1980
8 Graph isomorphism (context) - Miller - 1979
7 Subtree isomorphism in O (context) - Matula - 1978
1 Search for a unique incidence matrix of a graph (context) - Proskurowski
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uu.nl/research/techreps/techreps.php?submit=show+reports&YEAR=&AUTH=&GRP=): More
On the Two-Level Uncapacitated Facility Location Problem - Aardal, Labbé (1995) (Correct)
A Tourist Guide through Treewidth - Bodlaender (1993) (Correct)
Predictive Probabilistic Models for Treatment Planning in.. - Peek (1998) (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