Subgraph isomorphism in planar graphs and related problems.

Eppstein, David

Journal of Graph Algorithms and Applications (1999)

  • Volume: 3, Issue: 1-3, page Paper No. 3, 27 p.-Paper No. 3, 27 p.
  • ISSN: 1526-1719

How to cite

top

Eppstein, David. "Subgraph isomorphism in planar graphs and related problems.." Journal of Graph Algorithms and Applications 3.1-3 (1999): Paper No. 3, 27 p.-Paper No. 3, 27 p.. <http://eudml.org/doc/232204>.

@article{Eppstein1999,
author = {Eppstein, David},
journal = {Journal of Graph Algorithms and Applications},
keywords = {subgraph isomorphism problem; planar graphs; tree-width; dynamic programming},
language = {eng},
number = {1-3},
pages = {Paper No. 3, 27 p.-Paper No. 3, 27 p.},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Subgraph isomorphism in planar graphs and related problems.},
url = {http://eudml.org/doc/232204},
volume = {3},
year = {1999},
}

TY - JOUR
AU - Eppstein, David
TI - Subgraph isomorphism in planar graphs and related problems.
JO - Journal of Graph Algorithms and Applications
PY - 1999
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 3
IS - 1-3
SP - Paper No. 3, 27 p.
EP - Paper No. 3, 27 p.
LA - eng
KW - subgraph isomorphism problem; planar graphs; tree-width; dynamic programming
UR - http://eudml.org/doc/232204
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.