24,317 research outputs found
Embedding a Forest in a Graph
For \math{p\ge 1}, we prove that every forest with \math{p} trees whose sizes
are can be embedded in any graph containing at least
vertices and having a minimum degree at least
.Comment: Working paper, submitte
Edge covering pseudo-outerplanar graphs with forests
A graph is called pseudo-outerplanar if each block has an embedding on the
plane in such a way that the vertices lie on a fixed circle and the edges lie
inside the disk of this circle with each of them crossing at most one another.
In this paper, we prove that each pseudo-outerplanar graph admits edge
decompositions into a linear forest and an outerplanar graph, or a star forest
and an outerplanar graph, or two forests and a matching, or
matchings, or linear
forests. These results generalize some ones on outerplanar graphs and
-minor-free graphs, since the class of pseudo-outerplanar graphs is a
larger class than the one of -minor-free graphs.Comment: This paper was done in the winter of 2009 and has already been
submitted to Discrete Mathematics for 3rd round of peer revie
Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings
Embeddings of graphs into distributions of trees that preserve distances in expectation are a cornerstone of many optimization algorithms. Unfortunately, online or dynamic algorithms which use these embeddings seem inherently randomized and ill-suited against adaptive adversaries. In this paper we provide a new tree embedding which addresses these issues by deterministically embedding a graph into a single tree containing O(log n) copies of each vertex while preserving the connectivity structure of every subgraph and O(log2 n)-approximating the cost of every subgraph. Using this embedding we obtain the first deterministic bicriteria approximation algorithm for the online covering Steiner problem as well as the first poly-log approximations for demand-robust Steiner forest, group Steiner tree and group Steiner forest.ISSN:1868-896
Efficient Frequent Subtree Mining Beyond Forests
A common paradigm in distance-based learning is to embed the instance space into some appropriately chosen feature space equipped with a metric and to define the dissimilarity between instances by the distance of their images in the feature space. If the instances are graphs, then frequent connected subgraphs are a well-suited pattern language to define such feature spaces. Identifying the set of frequent connected subgraphs and subsequently computing embeddings for graph instances, however, is computationally intractable. As a result, existing frequent subgraph mining algorithms either restrict the structural complexity of the instance graphs or require exponential delay between the output of subsequent patterns. Hence distance-based learners lack an efficient way to operate on arbitrary graph data. To resolve this problem, in this thesis we present a mining system that gives up the demand on the completeness of the pattern set to instead guarantee a polynomial delay between subsequent patterns. Complementing this, we devise efficient methods to compute the embedding of arbitrary graphs into the Hamming space spanned by our pattern set. As a result, we present a system that allows to efficiently apply distance-based learning methods to arbitrary graph databases. To overcome the computational intractability of the mining step, we consider only frequent subtrees for arbitrary graph databases. This restriction alone, however, does not suffice to make the problem tractable. We reduce the mining problem from arbitrary graphs to forests by replacing each graph by a polynomially sized forest obtained from a random sample of its spanning trees. This results in an incomplete mining algorithm. However, we prove that the probability of missing a frequent subtree pattern is low. We show empirically that this is true in practice even for very small sized forests. As a result, our algorithm is able to mine frequent subtrees in a range of graph databases where state-of-the-art exact frequent subgraph mining systems fail to produce patterns in reasonable time or even at all. Furthermore, the predictive performance of our patterns is comparable to that of exact frequent connected subgraphs, where available. The above method considers polynomially many spanning trees for the forest, while many graphs have exponentially many spanning trees. The number of patterns found by our mining algorithm can be negatively influenced by this exponential gap. We hence propose a method that can (implicitly) consider forests of exponential size, while remaining computationally tractable. This results in a higher recall for our incomplete mining algorithm. Furthermore, the methods extend the known positive results on the tractability of exact frequent subtree mining to a novel class of transaction graphs. We conjecture that the next natural extension of our results to a larger transaction graph class is at least as difficult as proving whether P = NP, or not. Regarding the graph embedding step, we apply a similar strategy as in the mining step. We represent a novel graph by a forest of its spanning trees and decide whether the frequent trees from the mining step are subgraph isomorphic to this forest. As a result, the embedding computation has one-sided error with respect to the exact subgraph isomorphism test but is computationally tractable. Furthermore, we show that we can leverage a partial order on the pattern set. This structure can be used to reduce the runtime of the embedding computation dramatically. For the special case of Jaccard-similarity between graph embeddings, a further substantial reduction of runtime can be achieved using min-hashing. The Jaccard-distance can be approximated using small sketch vectors that can be computed fast, again using the partial order on the tree patterns
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time
Thomassen characterized some 1-plane embedding as the forbidden configuration
such that a given 1-plane embedding of a graph is drawable in straight-lines if
and only if it does not contain the configuration [C. Thomassen, Rectilinear
drawings of graphs, J. Graph Theory, 10(3), 335-341, 1988].
In this paper, we characterize some 1-plane embedding as the forbidden
configuration such that a given 1-plane embedding of a graph can be re-embedded
into a straight-line drawable 1-plane embedding of the same graph if and only
if it does not contain the configuration. Re-embedding of a 1-plane embedding
preserves the same set of pairs of crossing edges.
We give a linear-time algorithm for finding a straight-line drawable 1-plane
re-embedding or the forbidden configuration.Comment: Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016). This is an extended
abstract. For a full version of this paper, see Hong S-H, Nagamochi H.:
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time,
Technical Report TR 2016-002, Department of Applied Mathematics and Physics,
Kyoto University (2016
Robust geometric forest routing with tunable load balancing
Although geometric routing is proposed as a memory-efficient alternative to traditional lookup-based routing and forwarding algorithms, it still lacks: i) adequate mechanisms to trade stretch against load balancing, and ii) robustness to cope with network topology change.
The main contribution of this paper involves the proposal of a family of routing schemes, called Forest Routing. These are based on the principles of geometric routing, adding flexibility in its load balancing characteristics. This is achieved by using an aggregation of greedy embeddings along with a configurable distance function. Incorporating link load information in the forwarding layer enables load balancing behavior while still attaining low path stretch. In addition, the proposed schemes are validated regarding their resilience towards network failures
- …