3471 search results - page 543 / 695 » Obstacle Numbers of Graphs |
152
click to vote
ESA
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
141
click to vote
FMCAD
2009
Springer
16 years 22 days ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
133
click to vote
BROADNETS
2007
IEEE
16 years 16 days ago
2007
IEEE
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
154
click to vote
EDOC
2007
IEEE
16 years 15 days ago
2007
IEEE
There has, in recent years, been growing interest in Model Driven Engineering (MDE), in which models are the primary design artifacts and transformations are applied to these mode...
159
click to vote
GLVLSI
2007
IEEE
16 years 15 days ago
2007
IEEE
This paper proposes a library-free technology mapping algorithm to reduce delay in combinational circuits. The algorithm reduces the overall number of series transistors through t...