534 search results - page 40 / 107 » Diameter critical graphs |
FASE
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in...
102
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
ICRA
2005
IEEE
15 years 4 months ago
2005
IEEE
— This paper presents a method for a planar rigid body consisting of multiple convex bodies to explore an unknown planar workspace, i.e., an unknown configuration space diffeomo...
106
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...