1188 search results - page 139 / 238 » Extended Graph Unification |
COCOA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
123
click to vote
FCA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
107
click to vote
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
Multi-label learning refers to the problems where an instance can be assigned to more than one category. In this paper, we present a novel Semi-supervised algorithm for Multi-labe...
COMBINATORICA
2007
14 years 10 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...