نتایج جستجو برای: eulerian graph
تعداد نتایج: 202900 فیلتر نتایج به سال:
(Abstract) Given an undirected graph G, we consider enumerating all Eulerian trails, that is, walks containing each of the edges in G just once. We consider achieving it with the enumeration of Hamiltonian paths with the zero-suppressed decision diagram (ZDD), a data structure that can efficiently store a family of sets satisfying given conditions. First we compute the line graph L(G), the grap...
Given a graph and pairs siti of terminals, the edge-disjoint paths problem is to determine whether there exist siti paths that do not share any edges. We consider this problem on acyclic digraphs. It is known to be NP-complete and solvable in time n where k is the number of paths. It has been a long-standing open question whether it is fixed-parameter tractable in k. We resolve this question in...
Eulerian Extension (EE) is the problem to make an arcweighted directed multigraph Eulerian by adding arcs of minimum total cost. EE is NP-hard and has been shown fixed-parameter tractable with respect to the number of arc additions. Complementing this result, on the way to answering an open question, we show that EE is fixedparameter tractable with respect to the combined parameter “number of c...
The Euler graph has vertices labelled (n, k) for n = 0, 1, 2, ... and k = 0, 1, ..., n, with k+1 edges from (n, k) to (n+1, k) and n−k+1 edges from (n, k) to (n+1, k+1). The number of paths from (0,0) to (n, k) is the Eulerian number A(n, k), the number of permutations of 1,2,...,n+1 with exactly n−k falls and k rises. We prove that the adic (Bratteli-Vershik) transformation on the space of inf...
Consider the random graph G(n,p) obtained by allowing each edge in complete on n vertices to be present with probability p independent of other edges. In this paper, we study minimum number edit operations needed convert into an Eulerian graph. We obtain deviation estimates for three types numbers based whether perform only additions or deletions a combination both and show that high probabilit...
1 1 General introduction 3 1.1 Combinatorial property testing . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.1 Property testing in the dense graph (and hypergraph) model . . . . 4 1.1.2 Testing graph properties in other models . . . . . . . . . . . . . . . 5 1.1.3 Testing massively parameterized properties . . . . . . . . . . . . . . 5 1.2 Probabilistically checkable proofs of proximit...
We say that a spanning eulerian subgraph F ⊂ G is a flower in a graph G if there is a vertex u ∈ V (G) (called the center of F ) such that all vertices of G except u are of the degree exactly 2 in F. A graph G has the flower property if every vertex of G is a center of a flower. Kaneko conjectured that G has the flower property if and only if G is hamiltonian. In the present paper we prove this...
Given a digraph (directed graph) with a labeling on its arcs, we study the problem of finding the Eulerian circuit of lexicographically minimum label. We prove that this problem is NP-complete in general, but if the labelling is locally injective (arcs going out from each vertex have different labels), we prove that it is solvable in linear time by giving an algorithm that constructs this circu...
In our attempt to justify the CVTree approach of inferring phylogenetic relationship among bacteria from their complete genomes without using sequence alignment, we encountered the problem of the uniqueness of the reconstruction of a protein sequence from its constituent K-peptides, which has a natural relation to a well-understood problem in graph theory, namely, the number of Eulerian loops i...
Control of parasitic capacitance and minimization of layout mismatch are very crucial in the analog physical design automation. In this paper we study the techniques for modeling the distributed parasitic capacitance, modeling the parasitic parameter mismatch due to process gradient and modeling the inner stack routing mismatch. Based on the proposed models, a transistor folding technique and a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید