962 search results - page 1 / 193 » Efficient Algorithms for Eulerian Extension |
WG
2010
Springer
13 years 2 months ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
AAAI
1996
13 years 6 months ago
1996
Although researchers have studied which factors influence the behavior of traditional search algorithms, currently not much is known about how domain properties influence the perf...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
KDD
2010
ACM
13 years 8 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
CORR
1999
Springer
13 years 4 months ago
1999
Springer
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...