3958 search results - page 160 / 792 » Dynamic Graph Algorithms with Applications |
200
click to vote
SDM
2004
SIAM
15 years 7 months ago
2004
SIAM
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
154
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
129
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that in each hyperedge e E there is at least one uniquely-colored vertex. This ...
166
click to vote
SOFSEM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
169
click to vote
NIPS
2007
15 years 7 months ago
2007
We provide a provably efficient algorithm for learning Markov Decision Processes (MDPs) with continuous state and action spaces in the online setting. Specifically, we take a mo...