4865 search results - page 611 / 973 » The Complexity of Graph Connectivity |
185
click to vote
CASC
2007
Springer
16 years 29 days ago
2007
Springer
For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. ...
144
click to vote
ICRA
2006
IEEE
16 years 25 days ago
2006
IEEE
Abstract— This paper revisits the multi-robot boundary coverage problem in which a group of k robots must inspect every point on the boundary of a 2-dimensional environment. We f...
185
click to vote
STOC
2006
ACM
16 years 22 days ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
163
click to vote
COORDINATION
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...
209
click to vote
DATE
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper describes new algorithms for systemlevel software synthesis, namely the scheduling and allocation of a set of complex tasks running at multiple rates on a heterogeneous...