DOIAbstract
AbstractThe problem of finding Euler tours in directed and undirected Euler graphs is considered. O(log |V|) time algorithms are given using a linear number of processors on a concurrent-read concurrent-write parallel RAM
AbstractThe problem of finding Euler tours in directed and undirected Euler graphs is considered. O(log |V|) time algorithms are given using a linear number of processors on a concurrent-read concurrent-write parallel RAM
This report records the author’s work during the project’s period. This project will study paral...
In this thesis we consider two sets of combinatorial structures defined on an Eulerian graph: the Eu...
Although a mathematical formula for counting the number of Eulerian circles in a directed graph is a...
AbstractThe problem of finding Euler tours in directed and undirected Euler graphs is considered. O(...
We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in paral...
Given a series-parallel graph, we consider the problem of drawing its layout in the plane (and the p...
A Dual-Eulerian graph is a plane multigraph G that contains an edge list which is simultaneously an ...
AbstractWe give a simple polynomial-time algorithm to exactly count the number of Euler tours (ETs) ...
AbstractA plane graph is dual-eulerian if it has an eulerian tour with the property that the same se...
We first present VLSI algorithms that run in O(n 2 ) steps for finding (and reporting) a fundament...
[[abstract]]In this paper, we consider some shortest path related problems Iron interval and circula...
AbstractA dual-Eulerian graph is a plane graph which has an ordering defined on its edge set which f...
AbstractRecently, He and Yesha gave an algorithm for recognizing directed series-parallel graphs in ...
We present a parallel algorithm which uses n 2 processors to find the connected components of an und...
Abstract: This paper is devoted to parallel algorithms for solving the following prefracta...
This report records the author’s work during the project’s period. This project will study paral...
In this thesis we consider two sets of combinatorial structures defined on an Eulerian graph: the Eu...
Although a mathematical formula for counting the number of Eulerian circles in a directed graph is a...
AbstractThe problem of finding Euler tours in directed and undirected Euler graphs is considered. O(...
We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in paral...
Given a series-parallel graph, we consider the problem of drawing its layout in the plane (and the p...
A Dual-Eulerian graph is a plane multigraph G that contains an edge list which is simultaneously an ...
AbstractWe give a simple polynomial-time algorithm to exactly count the number of Euler tours (ETs) ...
AbstractA plane graph is dual-eulerian if it has an eulerian tour with the property that the same se...
We first present VLSI algorithms that run in O(n 2 ) steps for finding (and reporting) a fundament...
[[abstract]]In this paper, we consider some shortest path related problems Iron interval and circula...
AbstractA dual-Eulerian graph is a plane graph which has an ordering defined on its edge set which f...
AbstractRecently, He and Yesha gave an algorithm for recognizing directed series-parallel graphs in ...
We present a parallel algorithm which uses n 2 processors to find the connected components of an und...
Abstract: This paper is devoted to parallel algorithms for solving the following prefracta...
This report records the author’s work during the project’s period. This project will study paral...
In this thesis we consider two sets of combinatorial structures defined on an Eulerian graph: the Eu...
Although a mathematical formula for counting the number of Eulerian circles in a directed graph is a...
Add to ORKG