نتایج جستجو برای: eulerian graphs
تعداد نتایج: 102409 فیلتر نتایج به سال:
For a graph G, a detachment operation at a vertex transforms the graph into a new graph by splitting the vertex into several vertices in such a way that the original graph can be obtained by contracting all the split vertices into a single vertex. A graph obtained from a given graph G by applying detachment operations at several vertices is called a detachment of graph G. We consider a detachme...
The Stochastic Eulerian Tour Problem (SETP) seeks the Eulerian tour of minimum expected length on an undirected Eulerian graph, when demand on the arcs that have to be serviced is probabilistic. In an earlier paper, we have shown that the SETP is NP-hard and derived several properties of the optimal tour. In this paper, we develop three constructive heuristics for the SETP. The first two are gr...
A colored eulerian digraph is an eulerian digraph G where a color is assigned to the tail of each edge and a color is assigned to the head of each edge. A compatible circuit is an eulerian circuit such that for every two consecutive edges uv and vw of the circuit, the color of the head of uv is different from the color of the tail of vw. Let S3 be the set of vertices of outdegree and indegree t...
Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain th...
We prove a decomposition result for locally finite graphs which can be used to extend results on edge-connectivity from finite to infinite graphs. It implies that every 4k-edge-connected graph G contains an immersion of some finite 2k-edge-connected Eulerian graph containing any prescribed vertex set (while planar graphs show that G need not contain a subdivision of a simple finite graph of lar...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید