Home |  ENGLISH |  Kontakt |  Impressum |  Datenschutz |  Anmelden |  KIT

Vortrag242

Aus Aifbportal

Wechseln zu: Navigation, Suche
Decidability and computability for matroids of bounded branch-width



Informationen zum Vortrag

Datum: 01. Oktober 2004
Titel: Decidability and computability for matroids of bounded branch-width
Referent: Detlef Seese

Veranstaltung:
Name: International Conference on Graph Transformations (ICGT 2004 - September 29th until October 1st, Rome) Satelite Workshop: Logic Graph Transformations, Finite and Infinite Structures
Ort: Rom
Land: D

Forschungsgruppe: Komplexitätsmanagement