2612 search results - page 29 / 523 » Switching Graphs and Their Complexity |
IPL
2010
14 years 10 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...
VISUALIZATION
1996
IEEE
15 years 4 months ago
1996
IEEE
We are investigating methods for simplifying complex models for interactive visualizations using texture-based representations. This paper presents a simplification method which d...
107
click to vote
SODA
2003
ACM
15 years 1 months ago
2003
ACM
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
ESA
2001
Springer
15 years 4 months ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
STACS
2010
Springer
15 years 3 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...