I PRIKLADNAYA MATEMATIKA
(FUNDAMENTAL AND APPLIED MATHEMATICS)
2002, VOLUME 8, NUMBER 4, PAGES 1193-1214
S. A. Tishchenko
View as HTML View as gif image View as LaTeX source
We consider planar graphs with non-negatively weighted vertices,
edges, and faces.
We let vertices and edges have nonnegative costs.
In the case of triangular graphs with equal weights, the obtained
results are proved to be equivalent and optimal.
The analysis of planar graphs with non-negatively weighted faces for
a given plane embedding enables the separator search in dual
We demonstrate efficient planar graph characterization by the
separator method on several classical examples: graphs
All articles are published in Russian.
|Main page||Contents of the journal||News||Search|
Last modified: April 10, 2003