Titlebook: ;

拒绝

法律

https://doi.org/10.1007/978-3-642-48141-3while using at most . edges more than once. We show that MSE can be decided on bounded (i.e. finite) grids in linear time when both dimensions are either small or large compared to the number . of paths. On the contrary, we show that MSE remains .-hard on subgraphs of bounded grids..Finally, we stud

不易燃

Graph-Theoretic Concepts in Computer Science978-3-319-68705-6Series ISSN 0302-9743 Series E-ISSN 1611-3349

笼子

Modern Methods in Mathematical Physicstern graphs” can be embedded into a given graph . (that is, is isomorphic to a subgraph of .) is fixed-parameter tractable if . is a class of graphs of bounded tree width and .-complete otherwise..Towards this conjecture, we prove that the embedding problem is .-complete if . is the class of all grids or the class of all walls.