grant@garfield.cs.mun.ca (Grant Burton) (03/06/91)
I am doing research on graph minors, in particular I am interested
in the obstruction set for the class of partial k-trees (treewidth bounded)
for fixed k. The obstruction sets for k = {1,2,3} are
known, however to find the obstruction set for any k >= 4 seems to
be a formidable task. If anybody knows obstruction sets for k >= 4,
and can prove it, could you please send this information to me. I think it
is an open question if obstruction sets, for each fixed k, can be generated
by an algorithm. I would appreciate a response to this.
Any algorithm, idea, response, suggestion, comment, or critique should
be e-mailed to me.
Mailing address:
Grant Burton
Department of Computer Science
Memorial University of Newfoundland
St. John's, Newfoundland, Canada
E-mail
grant@garfield.cs.mun.ca
Thank You,
Grant Burton
--
| grant@garfield.cs.mun.ca
| Man said "let there be light", and there was fire. Man being lonely created
| machine in the image of himself, and chaos was discovered.grant@garfield.cs.mun.CA (Grant Burton) (03/06/91)
I am doing research on graph minors, in particular I am interested
in the obstruction set for the class of partial k-trees (treewidth bounded)
for fixed k. The obstruction sets for k = {1,2,3} are
known, however to find the obstruction set for any k >= 4 seems to
be a formidable task. If anybody knows obstruction sets for k >= 4,
and can prove it, could you please send this information to me. I think it
is an open question if obstruction sets, for each fixed k, can be generated
by an algorithm. I would appreciate a response to this.
Any algorithm, idea, response, suggestion, comment, or critique should
be e-mailed to me.
Mailing address:
Grant Burton
Department of Computer Science
Memorial University of Newfoundland
St. John's, Newfoundland, Canada
E-mail
grant@garfield.cs.mun.ca
Thank You,
Grant Burton
--
| grant@garfield.cs.mun.ca
| Man said "let there be light", and there was fire. Man being lonely created
| machine in the image of himself, and chaos was discovered.