Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19869596

Stable sets of maximum weight in (P7, banner)-free graphs

Author
MOSCA, Raffaele1
[1] Dipartimento di Science, Universitá degli Studi G. d'Annunzio, Pescara 65127, Italy
Source

Discrete mathematics. 2008, Vol 308, Num 1, pp 20-33, 14 p ; ref : 27 ref

CODEN
DSMHA4
ISSN
0012-365X
Scientific domain
Computer science; Mathematics
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Author keyword
Maximum weight stable set problem; (P7 banner)-free graphs; Polynomial time algorithm
Keyword (fr)
Graphe pondéré Maximum Temps polynomial 68R10 Algorithme polynomial
Keyword (en)
Weighted graph Maximum Polynomial time
Keyword (es)
Grafo pondero Máximo Tiempo polinomial
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A06 Information retrieval. Graph

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
19869596

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web