163 search results - page 11 / 33 » Unifying Two Graph Decompositions with Modular Decomposition |
184
Voted
TCAD
2010
14 years 10 months ago
2010
Abstract--In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different ex...
126
Voted
IJRR
2002
15 years 3 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
137
Voted
ICCAD
2009
IEEE
15 years 1 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...
123
Voted
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
123
Voted
ACSC
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...