1105 search results - page 14 / 221 » Linear choosability of graphs |
86
Voted
ESCAPE
2007
Springer
15 years 1 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
SCN
2008
Springer
14 years 9 months ago
2008
Springer
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
GD
1995
Springer
15 years 1 months ago
1995
Springer
This paper considers representations of graphs as rectangle-visibility graphs and as doubly linear graphs. These are, respectively, graphs whose vertices are isothetic rectangles ...
CPC
2004
14 years 9 months ago
2004
Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...