3267 search results - page 136 / 654 » Generalized quasirandom graphs |
137
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
133
click to vote
AAAI
2004
15 years 6 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
151
Voted
KDD
2010
ACM
15 years 2 months ago
2010
ACM
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
127
Voted
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
128
Voted
STACS
2004
Springer
15 years 10 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...