1395 search results - page 127 / 279 » (k, )-Distance-Hereditary Graphs |
126
click to vote
SPAA
1992
ACM
15 years 8 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
130
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
134
click to vote
COMBINATORICA
2006
15 years 4 months ago
2006
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...
119
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
We generalize the Ihara-Selberg zeta function to hypergraphs in a natural way. Hashimoto's factorization results for biregular bipartite graphs apply, leading to exact factor...
176
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...