Jørgen Bang-Jensen, Jing Huang, Anders Yeo  Home/Search
Context
Related
Links: ACM | imada.sdu.dk/pub/papers/pp2...07.ps.gz 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: imada.sdu.dk/Research/Prepr...ac (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given a k-arc-strong tournament T , we estimate the minimum number of arcs possible in a k-arc-strong spanning subdigraph of T . We give a construction which shows that for each k 2 there are tournaments T on n vertices such that every k-arc-strong spanning subdigraph of T contains at least nk + 1 8 (k + 1) 2 arcs. As our main result we prove that every k-arc-strong tournament contains a spanning k-arc-strong subdigraph with no more than nk+280k 2 arcs. Our proof implies the... (Update)
Similar documents (at the sentence level):
43.1%: Spanning k-arc-strong Subdigraphs with few arcs in.. - Bang-Jensen, Huang, Yeo (2001) (Correct)
Active bibliography (related documents): More All
0.8: Strongly Connected Spanning Subgraphs With the Minimum.. - Bang-Jensen, Yeo (2000) (Correct)
0.7: Strongly Connected Spanning Subgraphs with the Minimum.. - Bang-Jensen, Huang, Yeo (2000) (Correct)
0.4: Berge's Conjecture on Directed Path Partitions - A Survey - Hartman (2004) (Correct)
Similar documents based on text: More All
0.9: Short Certificates for Tournaments - Noga Alon Miklos (Correct)
0.6: Almost All Almost Regular c-Partite Tournaments with c.. - Tewes, Volkmann, Yeo (1998) (Correct)
0.6: A sufficient condition for a semicomplete multipartite.. - Bang-Jensen, Gutin.. (1997) (Correct)
BibTeX entry: (Update)
@techreport{ bangjensen00finding,
author = "Jørgen Bang-Jensen and Jing Huang and Anders Yeo",
title = "Finding small k-arc-strong Spanning Subdigraphs in k-arc-strong Tournaments",
number = "PP-2000-07",
month = "30,",
year = "2000",
url = "citeseer.ist.psu.edu/bang-jensen00finding.html" }
Citations (may not include all citations):62 The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972 DBLP
42 Edge-disjoint branchings (context) - Edmonds - 1973
26 Basic graph theory: paths and circuits (context) - Bondy - 1995
20 Approximating minimum-size k-connected spanning subgraphs vi.. - Cheriyan, Thurimella - 1996 ACM DBLP
13 Approximating the minimum equivalent digraph - Khuller, Raghavachari et al. - 1995 ACM DBLP
12 Chemins et circuits hamiltoniens des graphes complets (context) - Camion - 1959
12 On strongly connected digraphs with bounded cycle length - Khuller, Raghavachari et al. - 1996 ACM DBLP
11 An algorithm for finding a minimal equivalent graph of a dig.. (context) - Hsu - 1975 ACM DBLP
8 algorithms and applications (context) - Bang-Jensen, Gutin et al.
7 On two min--max theorems in graph theory (context) - Lov'asz - 1976
6 Strongly connected spanning subgraphs with the minimum numbe.. - Bang-Jensen, Huang et al. ACM
6 Generalizations of tournaments: A survey - Bang-Jensen, Gutin - 1998 ACM
6 A short proof of the Chen-Manalastas theorem (context) - Bondy - 1995 ACM
6 Strongly connected spanning subgraphs with the minimum numbe.. - Bang-Jensen, Yeo ACM
4 Every finite strongly connected digraph of stability 2 has a.. (context) - Chen, Manalastras - 1983
Documents on the same site (http://www.imada.sdu.dk/Research/Preprints/a-c.html): More
Selfdual Spaces With Complex Structures, Einstein-Weyl.. - Calderbank, Pedersen (1999) (Correct)
Automatic Mesh Refinement in Limit Analysis - Christiansen, Pedersen (1999) (Correct)
Convex-round Graphs Are Circular Perfect - Bang-Jensen, Huang (2000) (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