Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/5140
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSörensen, Kenneth-
dc.contributor.authorJANSSENS, Gerrit K.-
dc.date.accessioned2007-12-20T15:55:58Z-
dc.date.available2007-12-20T15:55:58Z-
dc.date.issued2000-
dc.identifier.citationWorkshop on Production Planning and Control (FUCAM). p. 117-127.-
dc.identifier.urihttp://hdl.handle.net/1942/5140-
dc.language.isoen-
dc.titleAn algorithm for generating all spanning trees of a graph in order of increasing cost including some applications-
dc.typeProceedings Paper-
local.bibliographicCitation.conferencedateOCT 2-4, 2000-
local.bibliographicCitation.conferencenameWORKSHOP ON PRODUCTION PLANNING AND CONTROL,Mons, Belgium-
local.bibliographicCitation.conferenceplaceMons, Belgium-
dc.identifier.epage127-
dc.identifier.spage117-
local.bibliographicCitation.jcatC2-
local.type.specifiedProceedings Paper-
dc.bibliographicCitation.oldjcatC2-
local.bibliographicCitation.btitleWorkshop on Production Planning and Control (FUCAM)-
item.contributorSörensen, Kenneth-
item.contributorJANSSENS, Gerrit K.-
item.fullcitationSörensen, Kenneth & JANSSENS, Gerrit K. (2000) An algorithm for generating all spanning trees of a graph in order of increasing cost including some applications. In: Workshop on Production Planning and Control (FUCAM). p. 117-127..-
item.fulltextNo Fulltext-
item.accessRightsClosed Access-
Appears in Collections:Research publications
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.