197 search results - page 16 / 40 » Some Topological Methods in Graph Coloring Theory |
FCT
2003
Springer
14 years 1 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
CCS
2007
ACM
14 years 2 months ago
2007
ACM
: To understand overall vulnerability to network attack, one must consider attacker exploits not just in isolation, but also in combination. That is, one must analyze how low-level...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
TIT
1998
13 years 8 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
VISSYM
2007
13 years 11 months ago
2007
Vortex breakdown bubbles are a subject which is of interest in many disciplines such as aeronautics, mixing, and combustion. Existing visualization methods are based on stream sur...