172 search results - page 15 / 35 » Planar Graphs with Topological Constraints |
162
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
157
click to vote
SAC
2010
ACM
16 years 20 days ago
2010
ACM
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
136
click to vote
GD
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
139
Voted
DATE
2008
IEEE
16 years 8 days ago
2008
IEEE
Extending 2-D planar topologies in integrated circuits (ICs) to a 3-D implementation has the obvious benefits of reducing the overall footprint and average interconnection length,...
186
click to vote
TIT
2010
15 years 16 days ago
2010
Abstract--Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algo...