<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=49363"><dc:title>How good can ants color graphs?</dc:title><dc:creator>Vesel,	Aleksander	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>barvanje grafov</dc:subject><dc:subject>postopek zaporednega barvanja</dc:subject><dc:subject>algoritem mravlje</dc:subject><dc:subject>Petford-Welsh</dc:subject><dc:subject>RLF</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>graph coloring</dc:subject><dc:subject>ants algorithm</dc:subject><dc:subject>Petford-Welsh</dc:subject><dc:subject>RLF</dc:subject><dc:subject/><dc:description>V notici primerjamo algoritem Coste in Hertza, algoritem "mravlje", s postopkom zaporednega barvanja (RLF, recursive largest first) in z algoritmom tipa Petforf-Welsh. V naših poskusih je zadnji precej boljši od prvih dveh.</dc:description><dc:date>1998</dc:date><dc:date>2015-07-10 11:56:01</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>49363</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>