192 search results - page 21 / 39 » On Graph Isomorphism for Restricted Graph Classes |
111
click to vote
ECCC
2008
15 years 1 months ago
2008
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
92
Voted
FOIKS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Dimension schemas are abstract models of the data hierarchies that populate OLAP warehouses. Although there is abundant work on schema equivalence in a variety of data mo...
87
Voted
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
117
click to vote
WG
2004
Springer
15 years 7 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
103
click to vote
JAIR
1998
15 years 1 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...