<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Relinking Marriages in Genealogies</dc:title><dc:creator>Mrvar,	Andrej	(Avtor)
	</dc:creator><dc:creator>Batagelj,	Vladimir	(Avtor)
	</dc:creator><dc:description>Genealogies can be represented as graphs in different ways: as Ore graphs, as p-graphs, or as bipartite p-graphs. p-graphs are usually more suitable for analyses. Some approaches to analysis of large genealogies implemented in program Pajek are presented and illustrated with analysis of some large ge- nealogies.</dc:description><dc:date>2004</dc:date><dc:date>2014-07-11 12:54:38</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>6937</dc:identifier><dc:identifier>UDK: 303</dc:identifier><dc:identifier>ISSN pri članku: 1854-0023</dc:identifier><dc:identifier>COBISS_ID: 23285085</dc:identifier><dc:language>sl</dc:language></metadata>
