2322 search results - page 346 / 465 » On a game in directed graphs |
169
click to vote
DMDW
2001
15 years 7 months ago
2001
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
162
click to vote
GVD
2001
15 years 7 months ago
2001
A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decom...
157
click to vote
IPCO
2004
15 years 7 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
175
click to vote
IJCAI
2001
15 years 7 months ago
2001
We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compil...
171
click to vote
MCU
2004
15 years 7 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...