[[abstract]]In this paper, we describe a systolic algorithm for extracting all of the fundamental regions in a planar graph. It takes O(n) computation time and uses O(n) processing elements, where n is the number of edges of the input planar graph.[[fileno]]2030256010084[[department]]資訊工程學
A digitized plane Π of size M is a rectangular √M × √M array of integer lattice points called pixels...
Abstract We present a general framework for designing fast subexponential exact and parameterized al...
We present new efficient parallel algorithms for planar graph isomorphism and several related proble...
[[abstract]]In this paper, we describe a systolic algorithm for extracting all of the fundamental re...
In this paper, we describe a systolic algorithm for extracting all of the fundamental regions in a p...
The authors consider the description of a systolic algorithm to solve the connected-component proble...
(eng) I present an efficient algorithm which lists the minimal separators of a planar graph in O(n) ...
[[abstract]]In this paper, we discuss the problem of finding all the regions, which are congruent to...
[[abstract]]In this paper, we discuss the problem of finding all the regions, which are congruent to...
(eng) I present an efficient algorithm which lists the minimal separators of a 3-connected planar gr...
International audienceWe present an efficient algorithm that lists the minimal separators of a 3-con...
In this paper we study the problem of efficiently and effectively extracting induced planar subgraph...
[[abstract]]A new fully-pipelined systolic algorithm for finding all the bridges of an undirected co...
A divide-and-conquer strategy based on variations of the Lipton-Tarjan planar separator theorem has ...
AbstractWe present an efficient algorithm that lists the minimal separators of a 3-connected planar ...
A digitized plane Π of size M is a rectangular √M × √M array of integer lattice points called pixels...
Abstract We present a general framework for designing fast subexponential exact and parameterized al...
We present new efficient parallel algorithms for planar graph isomorphism and several related proble...
[[abstract]]In this paper, we describe a systolic algorithm for extracting all of the fundamental re...
In this paper, we describe a systolic algorithm for extracting all of the fundamental regions in a p...
The authors consider the description of a systolic algorithm to solve the connected-component proble...
(eng) I present an efficient algorithm which lists the minimal separators of a planar graph in O(n) ...
[[abstract]]In this paper, we discuss the problem of finding all the regions, which are congruent to...
[[abstract]]In this paper, we discuss the problem of finding all the regions, which are congruent to...
(eng) I present an efficient algorithm which lists the minimal separators of a 3-connected planar gr...
International audienceWe present an efficient algorithm that lists the minimal separators of a 3-con...
In this paper we study the problem of efficiently and effectively extracting induced planar subgraph...
[[abstract]]A new fully-pipelined systolic algorithm for finding all the bridges of an undirected co...
A divide-and-conquer strategy based on variations of the Lipton-Tarjan planar separator theorem has ...
AbstractWe present an efficient algorithm that lists the minimal separators of a 3-connected planar ...
A digitized plane Π of size M is a rectangular √M × √M array of integer lattice points called pixels...
Abstract We present a general framework for designing fast subexponential exact and parameterized al...
We present new efficient parallel algorithms for planar graph isomorphism and several related proble...
DOI
Add to ORKG