Constructive algorithm for path-width and branch-width of matroids and rank-width of graphs
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Jeong, Ji Su | ko |
| dc.contributor.author | Kim, Eun Jung | ko |
| dc.contributor.author | Oum, Sang Il | ko |
| dc.date.accessioned | 2016-07-13T04:03:29Z | - |
| dc.date.available | 2016-07-13T04:03:29Z | - |
| dc.date.created | 2015-12-25 | - |
| dc.date.issued | 2015-01-19 | - |
| dc.identifier.citation | International Workshop on Graph Decomposition | - |
| dc.identifier.uri | http://hdl.handle.net/10203/211210 | - |
| dc.language | English | - |
| dc.publisher | Centre International De Rencontres Mathematiques | - |
| dc.title | Constructive algorithm for path-width and branch-width of matroids and rank-width of graphs | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.citation.publicationname | International Workshop on Graph Decomposition | - |
| dc.identifier.conferencecountry | FR | - |
| dc.identifier.conferencelocation | CIRM, Luminy | - |
| dc.contributor.localauthor | Oum, Sang Il | - |
| dc.contributor.nonIdAuthor | Kim, Eun Jung | - |
- Appears in Collection
- MA-Conference Papers(학술회의논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.