Results 1  10
of
27,980
Approximate distance oracles for unweighted graphs . . .
"... ������������ � Let be an undirected graph � on vertices, and ���������� � let denote the distance � in between two � vertices � and. Thorup and Zwick showed that for any +ve � integer, the � graph can be preprocessed to build a datastructure that can efficiently � reportapproximate distance betwee ..."
Abstract

Cited by 58 (10 self)
 Add to MetaCart
time if the graph is unweighted. One of the new ideas used in the improved algorithm also leads to the first linear time algorithm for computing an optimal �������� � sizespanner of an unweighted graph.
Finding Betweenness in Dense Unweighted Graphs
"... Abstract—Social network analysis (SNA) aims to identify and better determine the relationship amongst data in a graph representation.The interpretation of several core SNA measures, degree, closeness and betweenness centrality of a node, have been the subject of extensive research in recent years. W ..."
Abstract
 Add to MetaCart
. We concentrate on the betweenness property, which seeks to determine the relatedness of more than 2 nodes. We propose our betweenness in unweighted graph algorithm and compare it to the kpath centrality algorithm on two image collections. By design, our proposed algorithm is less restrictive
Fast Edge Orientation for Unweighted Graphs
"... We consider an unweighted undirected graph with n vertices, m edges, and edgeconnectivity 2k. The weak edge orientation problem requires that the edges of this graph be oriented so the resulting directed graph is at least k edgeconnected. NashWilliams proved the existence of such orientations and ..."
Abstract
 Add to MetaCart
We consider an unweighted undirected graph with n vertices, m edges, and edgeconnectivity 2k. The weak edge orientation problem requires that the edges of this graph be oriented so the resulting directed graph is at least k edgeconnected. NashWilliams proved the existence of such orientations
Metric recovery from directed unweighted graphs
"... We analyze directed, unweighted graphs obtained from xi ∈ Rd by connecting vertex i to j iff xi − xj  < ε(xi). Examples of such graphs include knearest neighbor graphs, where ε(xi) varies from point to point, and, arguably, many real world graphs such as copurchasing graphs. We ask whether we ..."
Abstract
 Add to MetaCart
We analyze directed, unweighted graphs obtained from xi ∈ Rd by connecting vertex i to j iff xi − xj  < ε(xi). Examples of such graphs include knearest neighbor graphs, where ε(xi) varies from point to point, and, arguably, many real world graphs such as copurchasing graphs. We ask whether
Abusing a hypergraph partitioner for unweighted graph partitioning
 CONTEMPORARY MATHEMATICS
, 2013
"... ..."
Approximating minimum maxstretch spanning trees on unweighted graphs
 In Proc. ACMSIAM Symposium on Discrete Algorithms
, 2004
"... Given a graph G and a spanning tree T of G, we say that T is a tree tspanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The problem of finding a tree tspanner minimizing t is referred to as the Minimum MaxStretch spanning Tree (MMST) problem. ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
. This paper concerns the MMST problem on unweighted graphs. The problem is known to be NPhard, and the paper presents an O(log n)approximation algorithm for it. Furthermore, it is established that unless P = NP, the problem cannot be approximated additively by any o(n) factor.
Local complementation rule for continuousvariable fourmode unweighted graph states
, 808
"... The local complementation rule is applied for continuousvariable (CV) graph states in the paper, which is an elementary graph transformation rule and successive application of which generates the orbit of any graph states. The corresponding local Gaussian transformations of local complementation fo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
for fourmode unweighted graph states were found, which do not mirror the form of the local Clifford unitary of qubit exactly. This work is an important step to characterize the local Gaussian equivalence classes of CV graph states.
An Õ(mn) GomoryHu Tree Construction Algorithm for Unweighted Graphs
"... We present a fast algorithm for computing a GomoryHu tree or cut tree for an unweighted undirected graph G = (V,E). The expected running time of our algorithm is Õ(mc) where E  = m and c is the maximum uv edge connectivity, where u, v ∈ V. When the input graph is also simple (i.e., it has no pa ..."
Abstract
 Add to MetaCart
We present a fast algorithm for computing a GomoryHu tree or cut tree for an unweighted undirected graph G = (V,E). The expected running time of our algorithm is Õ(mc) where E  = m and c is the maximum uv edge connectivity, where u, v ∈ V. When the input graph is also simple (i.e., it has
Multicuts in Unweighted Graphs with Bounded Degree and Bounded TreeWidth
 Integer Programming and Combinatorial Optimization
, 1998
"... The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices (s i ; t i ) of G, find a minimum set of edges of G whose removal disconnects each s i from the corresponding t i . The fractional Multicut problem is the dual of the wellknown Multicommodity Flo ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Flow problem. Multicut is known to be NPhard and Max SNPhard even when the input graph is restricted to being a tree. The main result of the paper is a polynomialtime approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded treewidth. That is, for any ffl ? 0, we
Results 1  10
of
27,980