54 research outputs found
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
In this paper, we address the problem of enumerating all induced subtrees in
an input k-degenerate graph, where an induced subtree is an acyclic and
connected induced subgraph. A graph G = (V, E) is a k-degenerate graph if for
any its induced subgraph has a vertex whose degree is less than or equal to k,
and many real-world graphs have small degeneracies, or very close to small
degeneracies. Although, the studies are on subgraphs enumeration, such as
trees, paths, and matchings, but the problem addresses the subgraph
enumeration, such as enumeration of subgraphs that are trees. Their induced
subgraph versions have not been studied well. One of few example is for
chordless paths and cycles. Our motivation is to reduce the time complexity
close to O(1) for each solution. This type of optimal algorithms are proposed
many subgraph classes such as trees, and spanning trees. Induced subtrees are
fundamental object thus it should be studied deeply and there possibly exist
some efficient algorithms. Our algorithm utilizes nice properties of
k-degeneracy to state an effective amortized analysis. As a result, the time
complexity is reduced to O(k) time per induced subtree. The problem is solved
in constant time for each in planar graphs, as a corollary
Approximating Mexican highways with slime mould
Plasmodium of Physarum polycephalum is a single cell visible by unaided eye.
During its foraging behavior the cell spans spatially distributed sources of
nutrients with a protoplasmic network. Geometrical structure of the
protoplasmic networks allows the plasmodium to optimize transport of nutrients
between remote parts of its body. Assuming major Mexican cities are sources of
nutrients how much structure of Physarum protoplasmic network correspond to
structure of Mexican Federal highway network? To find an answer undertook a
series of laboratory experiments with living Physarum polycephalum. We
represent geographical locations of major cities by oat flakes, place a piece
of plasmodium in Mexico city area, record the plasmodium's foraging behavior
and extract topology of nutrient transport networks. Results of our experiments
show that the protoplasmic network formed by Physarum is isomorphic, subject to
limitations imposed, to a network of principle highways. Ideas and results of
the paper may contribute towards future developments in bio-inspired road
planning
Efficient Enumeration of Bipartite Subgraphs in Graphs
Subgraph enumeration problems ask to output all subgraphs of an input graph
that belongs to the specified graph class or satisfy the given constraint.
These problems have been widely studied in theoretical computer science. As
far, many efficient enumeration algorithms for the fundamental substructures
such as spanning trees, cycles, and paths, have been developed. This paper
addresses the enumeration problem of bipartite subgraphs. Even though bipartite
graphs are quite fundamental and have numerous applications in both theory and
application, its enumeration algorithms have not been intensively studied, to
the best of our knowledge. We propose the first non-trivial algorithms for
enumerating all bipartite subgraphs in a given graph. As the main results, we
develop two efficient algorithms: the one enumerates all bipartite induced
subgraphs of a graph with degeneracy in time per solution. The other
enumerates all bipartite subgraphs in time per solution
Probabilistic Properties of Highly Connected Random Geometric Graphs
In this paper we study the probabilistic properties of reliable networks of minimal total edge lengths. We study reliability in terms of k-edge-connectivity in graphs in d-dimensional space. We show this problem fits into Yukich’s framework for Euclidean functionals for arbitrary k, dimension d and distant-power gradient p, with p < d. With this framework several theorems on the convergence of optimal solutions follow. We apply Yukich’s framework for functionals so that we can use partitioning algorithms that rapidly compute near-optimal solutions on typical examples. These results are then extended to optimal k-edge-connected power assignment graphs, where we assign power to vertices and charge per vertex. The network can be modelled as a wireless network
Metrics matter in community detection
We present a critical evaluation of normalized mutual information (NMI) as an
evaluation metric for community detection. NMI exaggerates the leximin method's
performance on weak communities: Does leximin, in finding the trivial
singletons clustering, truly outperform eight other community detection
methods? Three NMI improvements from the literature are AMI, rrNMI, and cNMI.
We show equivalences under relevant random models, and for evaluating community
detection, we advise one-sided AMI under the model
(all partitions of nodes). This work seeks (1) to start a conversation on
robust measurements, and (2) to advocate evaluations which do not give "free
lunch"
Double-normal pairs in the plane and on the sphere
A double-normal pair of a finite set S of points from Euclidean space is a pair of points {p p,q q} from S such that S lies in the closed strip bounded by the hyperplanes through p p and q q that are perpendicular to p pq q . A double-normal pair p pq q is strict if S∖{p p,q q} lies in the open strip. We answer a question of Martini and Soltan (2006) by showing that a set of n≥3 points in the plane has at most 3⌊n/2⌋ double-normal pairs. This bound is sharp for each n≥3 . In a companion paper, we have asymptotically determined this maximum for points in R 3 . Here we show that if the set lies on some 2 -sphere, it has at most 17n/4−6 double-normal pairs. This bound is attained for infinitely many values of n . We also establish tight bounds for the maximum number of strict double-normal pairs in a set of n points in the plane and on the sphere
- …