Small maximal independent sets and faster exact graph coloring.

Eppstein, David

Journal of Graph Algorithms and Applications (2003)

  • Volume: 7, Issue: 2, page 131-140
  • ISSN: 1526-1719

How to cite

top

Eppstein, David. "Small maximal independent sets and faster exact graph coloring.." Journal of Graph Algorithms and Applications 7.2 (2003): 131-140. <http://eudml.org/doc/50436>.

@article{Eppstein2003,
author = {Eppstein, David},
journal = {Journal of Graph Algorithms and Applications},
language = {eng},
number = {2},
pages = {131-140},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Small maximal independent sets and faster exact graph coloring.},
url = {http://eudml.org/doc/50436},
volume = {7},
year = {2003},
}

TY - JOUR
AU - Eppstein, David
TI - Small maximal independent sets and faster exact graph coloring.
JO - Journal of Graph Algorithms and Applications
PY - 2003
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 7
IS - 2
SP - 131
EP - 140
LA - eng
UR - http://eudml.org/doc/50436
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.