Samir Khuller, Balaji Raghavachari, Neal Young  Home/Search
Context Related
Links: ACM DBLP | drenchedrock.net/nea...boundedcycle.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: drenchedrock.net/neal_academic... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given a directed graph G = (V; E), a natural problem is to choose a minimum (Update)
Context of citations to this paper: More
...strong digraph with at most (1 1 r )n arcs. Furthermore, such a subdigraph can be found in polynomial time. Khuller et at [14, 15] proved that for general digraphs, a variant of the algorithm used in the proof of Theorem 4.2 (contracting cycles which are su#ciently long...
...2 problem is trivial. The minimum SCSS 3 problem can be solved in polynomial time, as shown by Khuller, Raghavachari and Young [14]. However, further improvement in this direction is limited: we show that the minimum SCSS 5 problem is NP hard. In fact, we show that...
Cited by: More
Approximating Minimum-Size k-Connected Spanning Subgraphs.. - Cheriyan, Thurimella (2000) (Correct)
Approximating the Minimum Equivalent Digraph - Khuller, RAGHAVACHARI, YOUNG (1995) (Correct)
Spanning k-arc-strong Subdigraphs with few arcs in.. - Bang-Jensen, Huang, Yeo (2001) (Correct)
Similar documents (at the sentence level):
6.9%: On Strongly Connected Digraphs with Bounded Cycle Length - Khuller, Raghavachari, Young (1996) (Correct)
Active bibliography (related documents): More All
0.3: Approximating The Minimum Equivalent Digraph - Khuller, Raghavachari, Young (1995) (Correct)
0.3: Approximation Algorithms for Finding Highly Connected Subgraphs - Khuller (1996) (Correct)
0.1: Strongly Connected Spanning Subgraphs with the Minimum.. - Bang-Jensen, Huang, Yeo (1999) (Correct)
Similar documents based on text: More All
0.1: A Network-Flow Technique for Finding Low-Weight.. - Fekete, Khuller.. (1996) (Correct)
0.1: Low Degree Spanning Trees of Small Weight - Khuller, RAGHAVACHARI, YOUNG (1996) (Correct)
Related documents from co-citation: More All
9: An algorithm for finding a minimal equivalent graph of a digraph (context) - Hsu - 1975
9: The Transitive Reduction of a Directed Graph (context) - Aho, Garey et al. - 1972
8: Approximating the Minimum Equivalent Digraph - Khuller, Raghavachari et al. - 1995
BibTeX entry: (Update)
S. Khuller, B. Raghavachari and N. Young, On strongly connected digraphs with bounded cycle length, Disc. Applied Math. 69 (1996) 281-289. http://citeseer.ist.psu.edu/khuller96strongly.html More
@article{ khuller96strongly,
author = "Khuller and Raghavachari and Young",
title = "On Strongly Connected Digraphs with Bounded Cycle Length",
journal = "DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science",
volume = "69",
year = "1996",
url = "citeseer.ist.psu.edu/khuller96strongly.html" }
Citations (may not include all citations):4212 Computers and Intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
185 algorithm for maximum matching in bipartite graphs (context) - Hopcroft, Karp - 1973
145 Easy problems for tree-decomposable graphs - Arnborg, Lagergren et al. - 1991 ACM DBLP
62 The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972
38 Fundamental Algorithms (context) - Knuth - 1973
13 Approximating the minimum equivalent digraph - Khuller, Raghavachari et al. - 1995 ACM DBLP
11 An algorithm for finding a minimal equivalent graph of a dig.. (context) - Hsu - 1975 ACM DBLP
6 An algorithm for a minimum cover of a graph (context) - Norman, Rabin - 1959
5 An algorithm for finding the minimum equivalent graph of a d.. (context) - Moyles, Thompson - 1969
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.drenchedrock.net/neal_academic/papers/): More
K-Medians, Facility Location, and the Chernoff-Wald Bound - Young (2000) (Correct)
Randomized Rounding without Solving the Linear Program - Young (1995) (Correct)
Data Collection for the Sloan Digital Sky Survey - A.. - Lupton, Maley, Young (1996) (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