Published in
Elsevier, Information Processing Letters, 2(92), p. 57-63
DOI: 10.1016/j.ipl.2004.06.019
Springer Verlag, Lecture Notes in Computer Science, p. 58-67
DOI: 10.1007/978-3-540-24587-2_8
Links
Tools
Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees
This paper was not found in any repository, but could be made available legally by the author.
Full text: Unavailable
Postprint:
archiving forbidden
Published version:
archiving forbidden
Data provided by 