Lupa

Show document Help

A- | A+ | Print
Title:Planarity testing algorithms : zaključna naloga
Authors:ID Babić, Uroš (Author)
ID Bašić, Nino (Mentor) More about this mentor... This link opens in a new window
Files: This document has no files. This document may have a physical copy in the library of the organization, check the status via COBISS. Link is opened in a new window
Language:English
Work type:Final paper
Typology:2.11 - Undergraduate Thesis
Organization:FAMNIT - Faculty of Mathematics, Science and Information Technologies
Keywords:graph planarity, planarity testing, Boyer–Myrvold algorithm, Kuratowski/Wagner theorem, depth-first search (DFS), lowpoint values, articulation points, biconnected components, graph embedding, graph6 format
Place of publishing:Koper
Place of performance:Koper
Publisher:U. Babić
Year of publishing:2025
Year of performance:2025
Number of pages:1 spletni vir (1 datoteka PDF (IX, 37 str.))
PID:20.500.12556/RUP-21835 This link opens in a new window
UDC:004.021
COBISS.SI-ID:251759619 This link opens in a new window
Note:Sistemske zahteve: Adobe Acrobat Reader
Publication date in RUP:04.10.2025
Views:207
Downloads:0
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:Slovenian
Title:Algoritmi za testiranje planarnosti
Keywords:planarnost grafov, testiranje planarnosti, Boyer–Myrvoldov algoritem, Kuratowskijev/Wagnerjev izrek, globinski prvi sprehod (DFS), vrednosti lowpoint, vrednosti najnižje dosegljive točke, rezna vozlišča, dvopovezane komponente, vdelava grafa, format graph6


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica