- Speaker(s)
- Andrzej Proskurowski
- Affiliation
- University of Oregon, Eugene
- Date
- May 30, 2014, 2:15 p.m.
- Room
-
room 5820
- Seminar
- Research Seminar of the Logic Group: Approximate reasoning in data mining
Using a split-decomposition algorithm, we decide in linear time the membership in the class of graphs with linear rank-width at most 1 or
exhibit an induced subgraph which belongs to the set of minimal forbidden induced subgraphs for the class. From the complete set of such obstructions, we derive both the vertex-minor and pivot-minor obstructions for the class.
You are not logged in |
