Sciweavers

230 search results - page 1 / 46
» Time Varying Undirected Graphs
Sort
View
COLT
2008
Springer
13 years 11 months ago
Time Varying Undirected Graphs
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...
Shuheng Zhou, John D. Lafferty, Larry A. Wasserman
COMBINATORICS
2002
89views more  COMBINATORICS 2002»
13 years 9 months ago
Generating a Random Sink-free Orientation in Quadratic Time
A sink-free orientation of a finite undirected graph is a choice of orientation
Henry Cohn, Robin Pemantle, James Gary Propp
SIAMCOMP
2008
77views more  SIAMCOMP 2008»
13 years 9 months ago
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
Philip N. Klein
FOCS
1990
IEEE
14 years 1 months ago
Time-Space Tradeoffs for Undirected Graph Traversal
Paul Beame, Allan Borodin, Prabhakar Raghavan, Wal...
FSTTCS
2007
Springer
14 years 3 months ago
Undirected Graphs of Entanglement 2
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale