5100 search results - page 12 / 1020 » The Linear Complexity of a Graph |
SI3D
2003
ACM
14 years 1 months ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
STOC
1996
ACM
13 years 12 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
COMBINATORICA
2008
13 years 7 months ago
2008
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an (w)
IJCNN
2007
IEEE
14 years 2 months ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...