Add to ORKGAbstract. The girth of a graph is the minimum weight of all simple cycles of the graph. We study the problem of determining the girth of an n-node unweighted undirected planar graph. The first nontrivial algorithm for the problem, given by Djidjev, runs in O(n5/4 logn) time. Chalermsook, Fakcharoenphol, and Nanongkai reduced the running time to O(n log2 n). Weimann and Yuster further reduced the running time to O(n logn). In this paper, we solve the problem in O(n) time
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
Let S subset R^2 be a set of n sites, where each s in S has an associated radius r_s > 0. The disk g...
The girth of a directed graph is the length of its shortest directed cycle. We consider the problem ...
The girth of a graph G has been defined as the length of a shortest cycle of G. We design an O(n(5/4...
As defined ingraph theory, the girth of a given graph is the length of its shortest cycle. Most of t...
© Copyright 2018 by SIAM. The girth of a graph, i.e. the length of its shortest cycle, is a fundamen...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
In this paper we introduce efficient parallel algorithms for finding the girth in a graph or digraph...
In 1975, Erdos proposed the problem of determining the maximal number of edges in a graph on n verti...
We give a deterministic algorithm that constructs a graph of girth $log_k(n) + O(1)$ and minimum deg...
The g-girth-thickness θ(g, G) of a graph G is the smallest number of planar subgraphs of girth at le...
The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Lou...
AbstractThe girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph. D. disserta...
Given an n-vertex m-edge graph G with non-negative edge-weights, a shortest cycle of G is one minimi...
We study the problem of recognizing graph powers and computing roots of graphs. Our focus is on clas...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
Let S subset R^2 be a set of n sites, where each s in S has an associated radius r_s > 0. The disk g...
The girth of a directed graph is the length of its shortest directed cycle. We consider the problem ...
The girth of a graph G has been defined as the length of a shortest cycle of G. We design an O(n(5/4...
As defined ingraph theory, the girth of a given graph is the length of its shortest cycle. Most of t...
© Copyright 2018 by SIAM. The girth of a graph, i.e. the length of its shortest cycle, is a fundamen...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
In this paper we introduce efficient parallel algorithms for finding the girth in a graph or digraph...
In 1975, Erdos proposed the problem of determining the maximal number of edges in a graph on n verti...
We give a deterministic algorithm that constructs a graph of girth $log_k(n) + O(1)$ and minimum deg...
The g-girth-thickness θ(g, G) of a graph G is the smallest number of planar subgraphs of girth at le...
The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Lou...
AbstractThe girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph. D. disserta...
Given an n-vertex m-edge graph G with non-negative edge-weights, a shortest cycle of G is one minimi...
We study the problem of recognizing graph powers and computing roots of graphs. Our focus is on clas...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
Let S subset R^2 be a set of n sites, where each s in S has an associated radius r_s > 0. The disk g...
The girth of a directed graph is the length of its shortest directed cycle. We consider the problem ...