Vortrag242/en

Decidability and computability for matroids of bounded branch-width

Detlef Seese

About the Talk

Date: 2004-10-01
Title: Decidability and computability for matroids of bounded branch-width
Author: Detlef Seese

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

Research Group: Complexity Management