1172 search results - page 208 / 235 » Path Algorithms on Regular Graphs |
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Graphical models are useful for capturing interdependencies of statistical variables in various fields. Estimating parameters describing sparse graphical models of stationary mul...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
ICDE
2004
IEEE
14 years 11 months ago
2004
IEEE
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
SPAA
2006
ACM
14 years 3 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...