Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
An algorithm of graph planarity testing and cross minimization
Authors: Vitalie Cotelea, Stela Pripa
– 0.15 Mb
Abstract
This paper presents an overview on one compartment from the graph theory, called graph planarity testing. It covers the fundamental concepts and important work in this area. Also a new approach is presented, which tests if a graph is planar in linear time O(n) and it can be used to determine the minimum crosses in a graph if it isn't planar.Vitalie Cotelea, Stela Pripa
Vitalie Cotelea
Academy of Economic Studies of Moldova
Phone: (+373 22) 40 28 87
E-mail:
Stela Pripa
Academy of Economic Studies of Moldova
Phone: (+373 22) 72 71 24
E-mail:
Vitalie Cotelea
Academy of Economic Studies of Moldova
Phone: (+373 22) 40 28 87
E-mail:
Stela Pripa
Academy of Economic Studies of Moldova
Phone: (+373 22) 72 71 24
E-mail:
Fulltext
– 0.15 Mb
Contents
- Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane
- An algorithm of graph planarity testing and cross minimization
- Minimum convex partitions of multidimensional polyhedrons
- A Sumudu based algorithm for solving differential equations
- An approach for NL text interpretation
- Arch-pattern based design and aspect-oriented implementation of Readers-Writers concurrent problem
- Distance voting (e-voting): the ways of its applicability in Moldova
