Pierre Kelsen, Vijaya Ramachandran  Home/Search
Context Related
| utexas.edu/pub/techrepor...tr9117.ps.Z 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: utexas.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Let P be a property of graphs (directed or undirected). We consider the following problem: given a graph G that has property P , find a minimal spanning subgraph of G with property P . We describe an algorithm for this problem and prove that it is correct under some rather weak assumptions about P . We then analyze the number of iterations of this algorithm. By suitably restricting the graph properties, we devise a general technique to construct graphs for which the algorithm requires a large... (Update)
Context of citations to this paper: More
...for finding a minimal spanning subgraph of a graph for various properties of undirected graphs. Algorithm 1 was first described in [14] while algorithms 2 and 3 are generalizations of algorithms for finding a minimal 2 edge connected and a minimal biconnected spanning...
Cited by: More
Computing Minimal Spanning Subgraphs in Linear Time - Han, Kelsen, Ramachandran.. (1995) (Correct)
Active bibliography (related documents): More All
0.5: An Efficient Parallel Algorithm for Computing a Maximal .. - Dahlhaus, Karpinski.. (1992) (Correct)
0.4: On Finding Minimal Two-Connected Subgraphs - Kelsen, Ramachandran (1992) (Correct)
0.3: Approximating The Minimum Equivalent Digraph - Khuller, Raghavachari, Young (1995) (Correct)
Similar documents based on text: More All
0.3: Embedding Cartesian Products of Graphs into de Bruijn Graphs - Andreae, Nölle, Schreiber (1995) (Correct)
0.2: Graph Augmentation And Related Problems: Theory And Practice - Hsu (1993) (Correct)
0.2: Workshop on Parallel Algorithms: From Solving Combinatorial.. - Flanagan, al. (1993) (Correct)
BibTeX entry: (Update)
P. Kelsen AND V. Ramachandran, The complexity of finding minimal spanning subgraphs, Tech. Report TR-91-17, 1991, Department of Computer Sciences, University of Texas, Austin, TX 78712. http://citeseer.ist.psu.edu/kelsen91complexity.html More
@techreport{ kelsen91complexity,
author = "Pierre Kelsen and Vijaya Ramachandran",
title = "The Complexity of Finding Minimal Spanning Subgraphs",
number = "CS-TR-91-17",
month = "1,",
year = "1991",
url = "citeseer.ist.psu.edu/kelsen91complexity.html" }
Citations (may not include all citations):4212 Computers and Intractability: a Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
199 A simple parallel algorithm for the maximal independent set .. (context) - Luby - 1986
36 Graph theory (context) - Tutte - 1984
35 Node- and edge-deletion NP-complete problems (context) - Yannakakis - 1978
34 A new parallel algorithm for the maximal independent set pro.. - Goldberg, Spencer - 1989
25 The node-deletion problem for hereditary properties is NP - .. (context) - Lewis, Yannikakis - 1980
16 The complexity of parallel search (context) - Karp, Upfal et al. - 1988
9 Transitive compaction in parallel via branchings (context) - Gibbons, Karp et al. - 1991
8 Personal communication (context) - Simon - 1990
7 Private communication (context) - Chung, Graham - 1977
4 Finding a minimal transitive reduction in a strongly connect.. (context) - Simon - 1989
3 An algorithmic approach to extremal graph problems (context) - Han - 1991
2 An efficient parallel algorithm for finding a maximal indepe.. (context) - Kelsen - 1990
1 An efficient algorithm for the 3MIS problem (context) - Dahlhaus, Karpinski - 1989
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.utexas.edu.html): More
Stack Tracing In A Statically Typed Language - Diwan (1991) (Correct)
Combining Top-down and Bottom-up Techniques in Inductive .. - Zelle, Mooney, Konvisser (1994) (Correct)
Expert Systems for Monitoring and Control - Dvorak (1987) (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