1101 search results - page 57 / 221 » An Algorithm for the Graph Crossing Number Problem |
119
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
121
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
156
click to vote
SAC
2003
ACM
15 years 7 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
105
Voted
CRITIS
2007
15 years 4 months ago
2007
Abstract In this paper we discuss the properties and algorithmic methods for the identification and classification of cyclical interdependencies in critical infrastructures based...
124
click to vote
GD
2006
Springer
15 years 6 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...