Sciweavers

6740 search results - page 114 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
SODA
2001
ACM
97views Algorithms» more  SODA 2001»
15 years 7 months ago
An efficient algorithm for the configuration problem of dominance graphs
Ernst Althaus, Denys Duchier, Alexander Koller, Ku...
SODA
2003
ACM
138views Algorithms» more  SODA 2003»
15 years 7 months ago
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
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
CORR
2008
Springer
60views Education» more  CORR 2008»
15 years 6 months ago
Finding links and initiators: a graph reconstruction problem
Consider a 0
Heikki Mannila, Evimaria Terzi
CSUR
2008
64views more  CSUR 2008»
15 years 6 months ago
Solving problems on recursively constructed graphs
Richard B. Borie, R. Gary Parker, Craig A. Tovey
ARSCOM
2006
96views more  ARSCOM 2006»
15 years 6 months ago
The Weighted Integrity Problem is Polynomial for Interval Graphs
Sibabrata Ray, Rajgopal Kannan, Danyang Zhang, Hon...