| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 1116 5 |
| Ultima descărcare din IBN: 2022-01-29 19:03 |
| Căutarea după subiecte similare conform CZU |
| 004.415:519.17 (1) |
| Programe. Software (296) |
| Analiză combinatorică. Teoria grafurilor (115) |
 SM ISO690:2012COTELEA, Vitalie, PRIPA, Stela. An algorithm of graph planarity testing and cross minimization. In: Computer Science Journal of Moldova, 2007, nr. 3(45), pp. 278-287. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 3(45) / 2007 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004.415:519.17 | ||||||
| Pag. 278-287 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
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. |
||||||
|
|
|
|
