Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo  Home/Search
Context Related
| math.science.unitn.it/~rrizzi...p1p2.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: math.science.unitn.it/~rr...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Let G be a xed set of digraphs. Given a digraph H, a G-packing in H is a collection P of vertex disjoint subgraphs of H, each isomorphic to a member of G. A G-packing P is maximum if the number of vertices belonging to members of P is maximum, over all G-packings. (Update)
Cited by: More
On the Complexity of Digraph Packings - Brewster, Rizzi (2004) (Correct)
Similar documents (at the sentence level):
9.7%: Packing Paths in Digraphs - Brewster, Hell, Pantel, Yeo (1998) (Correct)
Active bibliography (related documents): More All
0.3: Matroids Induced by Packing Subgraphs - Janata (2003) (Correct)
0.3: The Subchromatic Index of Graphs - Fiala, Le (2004) (Correct)
0.2: Looking for a version of Schaefer's dichotomy theorem when each.. - Istrate (1997) (Correct)
Similar documents based on text: More All
0.3: A Simple Minimum T-Cut Algorithm - Rizzi (2002) (Correct)
0.3: Minimum T-cuts and optimal T-pairings - Rizzi (2002) (Correct)
0.2: Finding 1-Factors in Bipartite Regular Graphs, and Edge-Coloring.. - Rizzi (2001) (Correct)
BibTeX entry: (Update)
R. C. Brewster, P. Hell, S. H. Pantel, R. Rizzi, and A. Yeo, Packing paths in digraphs, submitted. http://citeseer.ist.psu.edu/725176.html More
@misc{ brewster-packing,
author = "R. Brewster and P. Hell and S. Pantel and R. Rizzi and A. Yeo",
title = "Packing paths in digraphs",
text = "R. C. Brewster, P. Hell, S. H. Pantel, R. Rizzi, and A. Yeo, Packing paths
in digraphs, submitted.",
url = "citeseer.ist.psu.edu/725176.html" }
Citations (may not include all citations):185 algorithm for maximum matching in bipartite graphs (context) - Hopcroft, Karp - 1973
164 Society for Industrial and Applied Mathematics (context) - Tarjan, Network - 1983
75 Matching Theory (context) - Lov, Plummer - 1986
61 Planar formulae and their uses (context) - Lichtenstein - 1982
33 Canadian Journal of Mathematics (context) - Edmonds, trees - 1965
7 Ecient subgraph packing (context) - Loebl, Poljak - 1993
6 Information Processing Letters (context) - Hell, Kirkpatrick et al. - 1981
5 Packings by cliques and by nite families of graphs (context) - Hell, Kirkpatrick - 1984
5 Flows in undirected unit capacity networks - Goldberg, Rao - 1999
4 Operations Research Letters (context) - Cornu, Hartvigsen et al. - 1982
3 Path factors of a graph (context) - Akiyama, Kano - 1985
2 Graph Packing Problems (context) - Pantel - 1998
1 Digraph packings with stars (context) - Brewster, Hell et al.
1 Sidepath results on packing P 1 's and P 2 's (context) - Brewster, Hell et al.
1 Digraph packings with hypomatchable graphs and propellers (context) - Brewster, Rizzi
1 Graph Packings (context) - Hell
Documents on the same site (http://www-math.science.unitn.it/~rrizzi/papers/scientificPublications/index.html): More
Improving a Family of Approximation Algorithms to Edge Color.. - Caprara, Rizzi (1998) (Correct)
Routing Permutations in Partitioned Optical Passive Stars Networks - Mei, Rizzi (2003) (Correct)
Some Simple Distributed Algorithms for Sparse Networks - Panconesi, Rizzi (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