2487 search results - page 393 / 498 » Partitions of Graphs into Trees |
127
Voted
COCOA
2007
Springer
15 years 9 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...
154
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
214
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
164
click to vote
ASIAMS
2007
IEEE
15 years 9 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
123
Voted
VISUALIZATION
1996
IEEE
15 years 7 months ago
1996
IEEE
A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Re...