3757 search results - page 206 / 752 » The overlap number of a graph |
195
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
209
click to vote
HICSS
2011
IEEE
14 years 10 months ago
2011
IEEE
In enterprise data warehouses, different users in different business units often define their own application specific dimension hierarchies tailor made to their reporting and b...
164
click to vote
DAM
2008
15 years 6 months ago
2008
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
169
click to vote
DAM
2008
15 years 6 months ago
2008
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
154
click to vote
DM
2008
15 years 6 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...