Jørgen Bang-Jensen, Jing Huang, Anders Yeo  Home/Search
Context
Related
| brics.dk/~yeo/PS_file/...brics_00_38.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: brics.dk/~yeo/pre_info (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+ k(k-1) 2 arcs. In fact, the tournaments in our construction have the property that every spanning subdigraph with minimum in- and out-degree at least k has nk + k(k-1) 2 arcs. This is... (Update)
Similar documents (at the sentence level):
40.3%: Finding small k-arc-strong Spanning Subdigraphs in.. - Bang-Jensen, Huang, Yeo (2000) (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.5: Highly Connected Hypergraphs Containing No Two.. - Bang-Jensen, Thomasse (2003) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.9: Short Certificates for Tournaments - Noga Alon Miklos (Correct)
0.7: 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)
@misc{ bang-jensen-spanning,
author = "Jørgen Bang-Jensen and Jing Huang and Anders Yeo",
title = "Spanning k-arc-strong Subdigraphs with few arcs in k-arc-strong Tournaments",
url = "citeseer.ist.psu.edu/bang-jensen01spanning.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
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
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
4 Every finite strongly connected digraph of stability 2 has a.. (context) - Chen, Manalastras - 1983
2 Springer Verlag London (context) - Bang-Jensen, Gutin et al. - 2000
1 On two min--max theorems in graph theory (context) - Lovasz - 1976
Documents on the same site (http://www.brics.dk/~yeo/pre_info.html): More
Solution of a conjecture of Volkmann on the number of vertices.. - Gutin, Yeo (Correct)
Complementary Cycles Containing Prescribed Vertices in.. - Bang-Jensen, Guo, Yeo (1997) (Correct)
Large Exponential Neighbourhoods for the Traveling Salesman Problem - Yeo (1997) (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