230 search results - page 1 / 46 » Time Varying Undirected Graphs |
COLT
2008
Springer
13 years 11 months ago
2008
Springer
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...
COMBINATORICS
2002
13 years 9 months ago
2002
A sink-free orientation of a finite undirected graph is a choice of orientation
SIAMCOMP
2008
13 years 9 months ago
2008
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...
FOCS
1990
IEEE
14 years 1 months ago
1990
IEEE
FSTTCS
2007
Springer
14 years 3 months ago
2007
Springer
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...