5889 search results - page 146 / 1178 » Graph Layout Problems |
109
Voted
ENDM
2008
15 years 4 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
178
Voted
ANTSW
2010
Springer
15 years 2 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
136
click to vote
GLVLSI
2002
IEEE
15 years 9 months ago
2002
IEEE
The paper presents a satisfiability-based method for solving the board-level multiterminal net routing problem in Clos-Folded FPGA based logic emulation systems. The approach tran...
146
Voted
SODA
2004
ACM
15 years 6 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
156
Voted
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...