A survey of the algorithmic properties of simplicial, upper bound and middle graphs.

Cheston, Grant A.; Jap, Tjoen Seng

Journal of Graph Algorithms and Applications (2006)

  • Volume: 10, Issue: 2, page 159-190
  • ISSN: 1526-1719

How to cite

top

Cheston, Grant A., and Jap, Tjoen Seng. "A survey of the algorithmic properties of simplicial, upper bound and middle graphs.." Journal of Graph Algorithms and Applications 10.2 (2006): 159-190. <http://eudml.org/doc/55398>.

@article{Cheston2006,
author = {Cheston, Grant A., Jap, Tjoen Seng},
journal = {Journal of Graph Algorithms and Applications},
keywords = {Efficient algorithms},
language = {eng},
number = {2},
pages = {159-190},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {A survey of the algorithmic properties of simplicial, upper bound and middle graphs.},
url = {http://eudml.org/doc/55398},
volume = {10},
year = {2006},
}

TY - JOUR
AU - Cheston, Grant A.
AU - Jap, Tjoen Seng
TI - A survey of the algorithmic properties of simplicial, upper bound and middle graphs.
JO - Journal of Graph Algorithms and Applications
PY - 2006
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 10
IS - 2
SP - 159
EP - 190
LA - eng
KW - Efficient algorithms
UR - http://eudml.org/doc/55398
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.