9532 search results - page 247 / 1907 » Logic, Graphs, and Algorithms |
149
click to vote
GLVLSI
2006
IEEE
16 years 4 days ago
2006
IEEE
Most of the logic synthesis algorithms are not scalable for large networks and, for this reason, partitioning is often applied. However traditional mincut-based partitioning techn...
163
click to vote
ESA
2009
Springer
16 years 20 days ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
119
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
146
Voted
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
142
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropri...