5100 search results - page 34 / 1020 » The Linear Complexity of a Graph |
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
KDD
1998
ACM
14 years 1 days ago
1998
ACM
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
FOCS
2007
IEEE
14 years 2 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
13 years 11 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
13 years 7 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...