Sciweavers

5889 search results - page 124 / 1178

» Graph Layout Problems

148

CPM
2008
Springer

170views Combinatorics» more CPM 2008»

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

15 years 6 months ago

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

Download www.cs.ucr.edu

Nadja Betzler, Michael R. Fellows, Christian Komus...

claim paper

Read More »

107

COLOGNETWENTE
2008

77views Optimization» more COLOGNETWENTE 2008»

Exact Algorithms for the Vertex Separator Problem in Graphs

15 years 6 months ago

Exact Algorithms for the Vertex Separator Problem in Graphs

Download ctw08.dti.unimi.it

Victor F. Cavalcante, Cid C. de Souza

claim paper

Read More »

100

Voted

DRW
2003

110views Mathematics» more DRW 2003»

Average properties of combinatorial problems and thermodynamics of spin models on graphs

15 years 6 months ago

Average properties of combinatorial problems and thermodynamics of spin models on graphs

Download www.univie.ac.at

Alessandro Vezzani, Davide Cassi, Raffaella Burion...

claim paper

Read More »

97

SODA
2001
ACM

97views Algorithms» more SODA 2001»

An efficient algorithm for the configuration problem of dominance graphs

15 years 6 months ago

An efficient algorithm for the configuration problem of dominance graphs

Download www.univ-orleans.fr

Ernst Althaus, Denys Duchier, Alexander Koller, Ku...

claim paper

Read More »

157

Voted

SODA
2003
ACM

138views Algorithms» more SODA 2003»

Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs

15 years 6 months ago

Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs

Download www.cse.buffalo.edu

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...

Hung Q. Ngo, Van H. Vu

claim paper

Read More »

« Prev « First page 124 / 1178 Last » Next »