Sciweavers

Share
191 search results - page 1 / 39
» Extremal Problems For Transversals In Graphs With Bounded De...
Sort
View
COMBINATORICA
2006
137views more  COMBINATORICA 2006»
9 years 10 months ago
Extremal Problems For Transversals In Graphs With Bounded Degree
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
Tibor Szabó, Gábor Tardos
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
9 years 10 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
COMBINATORICA
2007
81views more  COMBINATORICA 2007»
9 years 10 months ago
Total domination of graphs and small transversals of hypergraphs
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
Stéphan Thomassé, Anders Yeo
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
8 years 1 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
GC
2002
Springer
9 years 10 months ago
An Extremal Problem on Degree Sequences of Graphs
Let G
Nathan Linial, Eyal Rozenman
books