Results 31 to 40 of about 70,417 (125)
$O(\log^2k/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm [PDF]
, 2018 In the Directed Steiner Tree (DST) problem we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of $k$ terminal nodes.
An +6 more
core +3 more sources
Strategic Learning and the Topology of Social Networks [PDF]
, 2015 We consider a group of strategic agents who must each repeatedly take one of two possible actions. They learn which of the two actions is preferable from initial private signals, and by observing the actions of their neighbors in a social network.
Mossel, Elchanan +2 more
core +3 more sources
NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs
, 2008 The Hamiltonian cycle problem is to decide whether a given graph has a Hamiltonian cycle. Bertossi and Bonuccelli (1986, Information Processing Letters, 23, 195-200) proved that the Hamiltonian Cycle Problem is NP-Complete even for undirected path graphs and left the Hamiltonian cycle problem open for directed path graphs. Narasimhan (1989, Information
Panda, B. S., Pradhan, D.
openaire +2 more sources
Asynchronous distributed algorithms for static and dynamic directed rooted graphs
, 2018 . The paper provides a review of distributed graph algorithms research conducted by authors. We consider an asynchronous distributed system model represented by a strongly connected directed rooted graph with bounded edge capacity (in a sense that only a
I. Burdonov +4 more
semanticscholar +1 more source
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
, 2014 We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights.
C Demetrescu +7 more
core +1 more source
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science, 2004 We present a new all-pairs shortest path algorithm that works with real-weighted graphs in the traditional comparison-addition model. It runs in O(mn + n2 log log n) time, improving on the long-standing bound of O(mn + n2 log n) derived from an ...
Seth Pettie
semanticscholar +1 more source
Orienting Graphs to Optimize Reachability
, 1996 The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to minimize the ...
Communicated V. Ramachandran +3 more
core +4 more sources
Grad and classes with bounded expansion I. decompositions [PDF]
, 2005 We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, grad r(G ...
De Mendez, Patrice Ossona +1 more
core
Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
, 2014 We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "intensity" of the loop-erased random walk in ${\mathbb Z}^2 ...
Kenyon, Richard W., Wilson, David B.
core +1 more source
, 2015 A cycle basis in an undirected graph is a minimal set of simple cycles whose symmetric differences include all Eulerian subgraphs of the given graph. We define a rooted cycle basis to be a cycle basis in which all cycles contain a specified root edge ...
Eppstein, David +2 more
core +1 more source