112 search results - page 9 / 23 » An edge colouring of multigraphs |
ISPD
1999
ACM
14 years 2 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
JGT
2008
13 years 9 months ago
2008
Given a fixed multigraph H with V (H) = {h1, . . . , hm}, we say that a graph G is H-linked if for every choice of m vertices v1, . . . , vm in G, there exists a subdivision of H i...
IMAGING
2000
13 years 11 months ago
2000
In this paper we present a comprehensive method for identifying probable shadow regions in an image. Doing so is relevant to computer vision, colour constancy, and image reproduct...
DM
2010
13 years 10 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
INFOVIS
2003
IEEE
14 years 3 months ago
2003
IEEE
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...