777 search results - page 17 / 156 » A fast algorithm for the computation of an upper bound on th... |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
ICCSA
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
IJCAI
2001
13 years 8 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
SCA
2007
13 years 10 months ago
2007
Simulation of deformations and collision detection are two highly intertwined problems that are often treated separately. This is especially true in existing elegant adaptive simu...