Linear time recognition of P 4 -indifference graphs.

Habib, Michael; Paul, Christophe; Viennot, Laurent

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2001)

  • Volume: 4, Issue: 2, page 173-178 p.
  • ISSN: 1365-8050

How to cite

top

Habib, Michael, Paul, Christophe, and Viennot, Laurent. "Linear time recognition of -indifference graphs.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 4.2 (2001): 173-178 p.. <http://eudml.org/doc/233265>.

@article{Habib2001,
author = {Habib, Michael, Paul, Christophe, Viennot, Laurent},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {algorithm; recognition},
language = {eng},
number = {2},
pages = {173-178 p.},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Linear time recognition of -indifference graphs.},
url = {http://eudml.org/doc/233265},
volume = {4},
year = {2001},
}

TY - JOUR
AU - Habib, Michael
AU - Paul, Christophe
AU - Viennot, Laurent
TI - Linear time recognition of -indifference graphs.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2001
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 4
IS - 2
SP - 173
EP - 178 p.
LA - eng
KW - algorithm; recognition
UR - http://eudml.org/doc/233265
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.