694 search results - page 3 / 139 » Open Graphs and Computational Reasoning |
MFCS
1992
Springer
14 years 1 months ago
1992
Springer
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
GD
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research i...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
ICS
2001
Tsinghua U.
14 years 1 months ago
2001
Tsinghua U.
For most parallel and high performance systems, tuning guides provide the users with advices to optimize the execution time of their programs. Execution time may be very sensitive...
IPL
2010
13 years 7 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...