Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

On the NP-completeness of certain network testing problems

Author
EVEN, S1 ; GOLDREICH, O; MORAN, S; TONG, P
[1] Technion Haifa, Dep. computer sci., Haifa, Israel
Source

Networks (New York, NY). 1984, Vol 14, Num 1, pp 1-24 ; ref : 10 ref

CODEN
NTWKAA
ISSN
0028-3045
Scientific domain
Control theory, operational research
Publisher
John Wiley & Sons, New York, NY
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Coloration graphe Minimisation Modélisation Problème NP complet Réseau transmission donnée Résolution problème Vertex Problème NP dur
Keyword (en)
Graph coloration Minimization Modeling NP complete problem Data transmission network Problem solving Vertex
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface

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

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