2125 search results - page 285 / 425 » On Graph Complexity |
81
Voted
NETCOOP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Optical Burst Switching proposes a future-proof alternative to the current electronic switching in the backbone. The involved optical buffers are implemented with a set o...
125
click to vote
CONCUR
1998
Springer
15 years 2 months ago
1998
Springer
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
113
Voted
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
TGIS
2010
14 years 4 months ago
2010
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...
84
Voted
SOFSEM
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...