Constructive algorithm for path-width and branch-width of matroids and rank-width of graphs

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 150
  • Download : 0
Publisher
Centre International De Rencontres Mathematiques
Issue Date
2015-01-19
Language
English
Citation

International Workshop on Graph Decomposition 


URI
http://hdl.handle.net/10203/211210
Appears in Collection
MA-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0