723 search results - page 85 / 145 » On the hyperbolicity constant in graphs |
203
click to vote
IWPEC
2004
Springer
15 years 11 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
149
click to vote
TOOLS
2010
IEEE
15 years 11 months ago
2010
IEEE
Supporting read-only and side effect free execution has been the focus of a large body of work in the area of statically typed programming languages. Read-onlyness in dynamically t...
145
click to vote
STOC
1995
ACM
15 years 9 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
142
click to vote
SIROCCO
2007
15 years 7 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
161
click to vote
SIROCCO
1998
15 years 7 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...