Results 1  10
of
37
Approximating the Domatic Number
"... A set of vertices in a graph is a dominating set if every vertex outside the set has aneighbor in the set. The domatic number problem is that of partitioning the vertices of a graph into the maximum number of disjoint dominating sets. Let n denote the number ofvertices, ffi the minimum degree, and ..."
Abstract

Cited by 76 (7 self)
 Add to MetaCart
(Show Context)
A set of vertices in a graph is a dominating set if every vertex outside the set has aneighbor in the set. The domatic number problem is that of partitioning the vertices of a graph into the maximum number of disjoint dominating sets. Let n denote the number ofvertices, ffi the minimum degree, and \Delta the maximum degree.We show that every graph has a domatic partition with (1o(1))(ffi + 1) / ln n dominatingsets, and moreover, that such a domatic partition can be found in polynomial time. This implies a (1 + o(1)) ln n approximation algorithm for domatic number, since the domaticnumber is always at most ffi + 1. We also show this to be essentially best possible. Namely,extending the approximation hardness of set cover by combining multiprover protocols with zeroknowledge techniques, we show that for every ffl> 0, a (1 ffl) ln napproximation impliesthat N P ` DT IM E(nO(log log n)). This makes domatic number the first natural maximization problem (known to the authors) that is provably approximable to within polylogarithmic factors but no better.We also show that every graph has a domatic partition with (1o(1))(ffi + 1) / ln \Delta dominating sets, where the &quot; o(1) &quot; term goes to zero as \Delta increases. This can be turned intoan efficient algorithm that produces a domatic partition of \Omega ( ffi / ln \Delta) sets.
Decomposition of Balanced Matrices
 J. COMBINATORIAL THEORY, SER. B
, 1999
"... A 0,1 matrix is balanced if it does not contain a square submatrix of odd order with two ones per row and per column. We show that a balanced 0,1 matrix is either totally unimodular or its bipartite representation has a cutset consisting of two adjacent nodes and some of their neighbors. This resul ..."
Abstract

Cited by 35 (6 self)
 Add to MetaCart
(Show Context)
A 0,1 matrix is balanced if it does not contain a square submatrix of odd order with two ones per row and per column. We show that a balanced 0,1 matrix is either totally unimodular or its bipartite representation has a cutset consisting of two adjacent nodes and some of their neighbors. This result yields a polytime recognition algorithm for balancedness. To prove the result, we first prove a decomposition theorem for balanced 0,1 matrices that are not strongly balanced.
On Powers of Chordal Graphs And Their Colorings
 Congr. Numer
, 2000
"... The kth power of a graph G is a graph on the same vertex set as G, where a pair of vertices is connected by an edge if they are of distance at most k in G. We study the structure of powers of chordal graphs and the complexity of coloring them. We start by giving new and constructive proofs of t ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
(Show Context)
The kth power of a graph G is a graph on the same vertex set as G, where a pair of vertices is connected by an edge if they are of distance at most k in G. We study the structure of powers of chordal graphs and the complexity of coloring them. We start by giving new and constructive proofs of the known facts that any power of an interval graph is an interval graph, and that any odd power of a general chordal graph is again chordal. We then show that it is computationally hard to approximately color the even powers of n vertex chordal graphs within an n 1 2 \Gammaffl factor, for any ffl ? 0. We present two exact and closed formulas for the chromatic polynomial for the kth power of a tree on n vertices. Furthermore, we give an O(kn) algorithm for evaluating the polynomial. Keywords: Chordal graphs, chromatic number, chromatic polynomial, coloring, interval graphs, power of a graph, tree. 1 Introduction In this paper we study the structure of powers of chordal graphs a...
shellable and unmixed clutters with a perfect matching of König type
 J. Pure Appl. Alg
"... Abstract. Let C be a clutter with a perfect matching e1,..., eg of König type and let ∆C be the StanleyReisner complex of the edge ideal of C. If all cminors of C have a free vertex and C is unmixed, we show that ∆C is pure shellable. We are able to describe, in combinatorial and algebraic terms, ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
(Show Context)
Abstract. Let C be a clutter with a perfect matching e1,..., eg of König type and let ∆C be the StanleyReisner complex of the edge ideal of C. If all cminors of C have a free vertex and C is unmixed, we show that ∆C is pure shellable. We are able to describe, in combinatorial and algebraic terms, when ∆C is pure. If C has no cycles of length 3 or 4, then it is shown that ∆C is pure if and only if ∆C is pure shellable (in this case ei has a free vertex for all i), and that ∆C is pure if and only if for any two edges f1, f2 of C and for any ei, one has that f1 ∩ei ⊂ f2 ∩ei or f2 ∩ei ⊂ f1 ∩ei. It is also shown that this ordering condition implies that ∆C is pure shellable, without any assumption on the cycles of C. Then we prove that complete admissible uniform clutters and their Alexander duals are unmixed. In addition, the edge ideals of complete admissible uniform clutters are facet ideals of shellable simplicial complexes, they are CohenMacaulay, and they have linear resolutions. Furthermore if C is admissible and complete, then C is unmixed. We characterize certain conditions that occur in a CohenMacaulay criterion for bipartite graphs of Herzog and Hibi, and extend some results of Faridi—on the structure of unmixed simplicial trees—to clutters with the König property without 3cycles or 4cycles. 1.
The Domatic Number Problem on Some Perfect Graph Families
 Information Processing Letters
, 1995
"... An extremely simple, linear time algorithm is given for constructing a domatic partition in totally balanced hypergraphs. This simplifies and generalizes previous algorithms for interval and strongly chordal graphs. On the other hand, the domatic number problem is shown to be NPcomplete for several ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
An extremely simple, linear time algorithm is given for constructing a domatic partition in totally balanced hypergraphs. This simplifies and generalizes previous algorithms for interval and strongly chordal graphs. On the other hand, the domatic number problem is shown to be NPcomplete for several families of perfect graphs, including chordal and bipartite graphs.
Algorithmic Aspects of the ConsecutiveOnes Property
, 2009
"... We survey the consecutiveones property of binary matrices. Herein, a binary matrix has the consecutiveones property (C1P) if there is a permutation of its columns that places the 1s consecutively in every row. We provide an overview over connections to graph theory, characterizations, recognition ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
(Show Context)
We survey the consecutiveones property of binary matrices. Herein, a binary matrix has the consecutiveones property (C1P) if there is a permutation of its columns that places the 1s consecutively in every row. We provide an overview over connections to graph theory, characterizations, recognition algorithms, and applications such as integer linear programming and solving Set Cover.
Grid Colorings in Steganography
"... A proper vertex coloring of a graph is called rainbow if, for each vertex v, all neighbors of v receive distinct colors. A kregular graph G is called rainbow (or domatically full) if it admits a rainbow (k + 1)coloring. The ddimensional grid graph Gd is the graph whose vertices are the points of ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
A proper vertex coloring of a graph is called rainbow if, for each vertex v, all neighbors of v receive distinct colors. A kregular graph G is called rainbow (or domatically full) if it admits a rainbow (k + 1)coloring. The ddimensional grid graph Gd is the graph whose vertices are the points of Z d and two vertices are adjacent if and only if their l1distance is 1. We use a simple construction to prove that Gd is rainbow for all d ≥ 1. We discuss an important application of this result in steganography.
Optimized Crew Scheduling at Air New Zealand
"... The aircrewscheduling problem consists of two important subproblems: the toursofduty planning problem to generate minimumcost tours of duty (sequences of duty periods and rest periods) to cover all scheduled flights, and the rostering problem to assign tours of duty to individual crew members. B ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
The aircrewscheduling problem consists of two important subproblems: the toursofduty planning problem to generate minimumcost tours of duty (sequences of duty periods and rest periods) to cover all scheduled flights, and the rostering problem to assign tours of duty to individual crew members. Between 1986 and 1999, Air New Zealand staff and consultants in collaboration with the University of Auckland have developed eight applicationspecific optimizationbased computer systems to solve all aspects of the toursofduty planning and rostering processes for Air New Zealandâs national and international operations. These systems have saved NZ$15,655,000 per year while providing crew rosters that better respect crew membersâ preferences.