3204 search results - page 256 / 641 » The b-chromatic Number of a Graph |
100
Voted
DAWAK
2010
Springer
15 years 1 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
111
Voted
ICCAD
2009
IEEE
14 years 10 months ago
2009
IEEE
Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the...
107
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Physical wave fields are often described by means of a vector field. Advances in sensor technology enable us to collect an increasing number of measurement at the same location ...
103
click to vote
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—We study scalable routing for a sensor network deployed in complicated 3D settings such as underground tunnels in gas system or water system. The nodes are in general 3D space b...
83
Voted
DAM
2002
15 years 17 days ago
2002
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...