Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/4229
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Costa, L. | pt |
dc.contributor.author | Fonseca, C. M. da | pt |
dc.contributor.author | Martins, E. A. | pt |
dc.date.accessioned | 2011-10-31T14:52:06Z | - |
dc.date.issued | 2009 | - |
dc.identifier.issn | 0024-3795 | pt |
dc.identifier.uri | http://hdl.handle.net/10773/4229 | - |
dc.description.abstract | In this paper we present some algorithms allowing an exhaustive account on the number of edges and faces of the acyclic Birkhoff polytope. | pt |
dc.description.sponsorship | CEOC | pt |
dc.description.sponsorship | FCT | pt |
dc.description.sponsorship | FEDER/POCI 2010 | pt |
dc.description.sponsorship | CMUC | pt |
dc.language.iso | eng | pt |
dc.publisher | Elsevier | pt |
dc.relation.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-58049221028&partnerID=40&md5=2650209f6bfe9896c14eb7154237bf4e | - |
dc.rights | restrictedAccess | por |
dc.subject | Acyclic Birkhoff polytope | pt |
dc.subject | Algorithms | pt |
dc.subject | Graphs | pt |
dc.subject | Number of edges | pt |
dc.subject | Number of faces | pt |
dc.subject | Tree | pt |
dc.title | Face counting on an Acyclic Birkhoff polytope | pt |
dc.type | article | pt |
dc.peerreviewed | yes | pt |
ua.distribution | international | pt |
degois.publication.firstPage | 1216 | pt |
degois.publication.issue | 4 | pt |
degois.publication.issue | 4 | - |
degois.publication.lastPage | 1235 | pt |
degois.publication.title | Linear Algebra and Its Applications | pt |
degois.publication.volume | 430 | pt |
dc.date.embargo | 10000-01-01 | - |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0024379508005065 | * |
Appears in Collections: | DMat - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Face counting on an acyclic Birkhoff polytope.pdf | ficheiro eletrónico | 226.08 kB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.