# Partially complemented representations of digraphs.

Dahlhaus, Elias; Gustedt, Jens; McConnell, Ross M.

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

- Volume: 5, Issue: 1, page 147-168
- ISSN: 1365-8050

## Access Full Article

top## How to cite

topDahlhaus, Elias, Gustedt, Jens, and McConnell, Ross M.. "Partially complemented representations of digraphs.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 5.1 (2002): 147-168. <http://eudml.org/doc/122068>.

@article{Dahlhaus2002,

author = {Dahlhaus, Elias, Gustedt, Jens, McConnell, Ross M.},

journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},

keywords = {efficient graph algorithms; data structures; search strategies; modular decomposition},

language = {eng},

number = {1},

pages = {147-168},

publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},

title = {Partially complemented representations of digraphs.},

url = {http://eudml.org/doc/122068},

volume = {5},

year = {2002},

}

TY - JOUR

AU - Dahlhaus, Elias

AU - Gustedt, Jens

AU - McConnell, Ross M.

TI - Partially complemented representations of digraphs.

JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

PY - 2002

PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD

VL - 5

IS - 1

SP - 147

EP - 168

LA - eng

KW - efficient graph algorithms; data structures; search strategies; modular decomposition

UR - http://eudml.org/doc/122068

ER -

## NotesEmbed ?

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