376 search results - page 61 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
146
click to vote
ISPAN
1997
IEEE
15 years 10 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
145
click to vote
SIAMDM
2008
15 years 6 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
153
click to vote
DM
2002
15 years 5 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
138
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
147
click to vote
JMLR
2010
15 years 24 days ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...