Packing directed cycles efficiently
type: Item
instance of: scholarly article
title: Packing directed cycles efficiently
zbMATH Open document ID: 1129.05035
author: Zeev Nutov
author: Raphael Yuster
published in: Discrete Applied Mathematics
publication date: 2007-02-19T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5128014
zbMATH Keywords: simple digraph
zbMATH Keywords: dicycle packing number
zbMATH Keywords: fractional dicycle packing
zbMATH Keywords: directed regularity lemma
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: linear program
MaRDI profile type: Publication
full work available at URL: j.dam.2006.04.033
OpenAlex ID: W2005943912
cites work: The Algorithmic Aspects of the Regularity Lemma
cites work: Testing subgraphs in directed graphs
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Packing Digraphs with Directed Closed Trails
cites work: Q3852212
cites work: Constructive Quasi-Ramsey Numbers and Tournament Ranking
cites work: Near perfect coverings in graphs and hypergraphs
cites work: Matchings and covers in hypergraphs
cites work: Nearly-perfect hypergraph packing is in NC
cites work: Integer and fractional packings in dense graphs
cites work: Q4471308
cites work: Approximation algorithms for cycle packing problems
cites work: On the integral dicycle packings and covers and the linear ordering polytope
cites work: Packing directed circuits fractionally
cites work: Q4200109
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: Integer and fractional packing of families of graphs
DOI: 10.1016/J.DAM.2006.04.033
Recommended article: Mathematical Foundations of Computer Science 2004
Recommended article: Packing directed cycles through a specified vertex set
Recommended article: Packing cycles in graphs
Recommended article: Packing cycles in undirected graphs
Recommended article: On packing shortest cycles in graphs
Recommended article: Packing directed circuits exactly
Recommended article: Packing cycles in complete graphs
Recommended article: Packing Directed Hamilton Cycles Online
Recommended article: Packing cycles through prescribed vertices
Recommended article: Labeled packing of cycles and circuits
description: scientific article; zbMATH DE number 5128014