Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Containment of butterflies in networks constructed by the line digraph operation

Author
HASUNUMA, T1 ; SHIBATA, Y1
[1] Department of Computer Science, Gunma University 1-5-1 Tenjin-cho, Kiryu, Gunma, 376, Japan
Source

Information processing letters. 1997, Vol 61, Num 1, pp 25-30 ; ref : 15 ref

CODEN
IFPLAT
ISSN
0020-0190
Scientific domain
Computer science
Publisher
Elsevier Science, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Keyword (fr)
Algorithme parallèle Graphe Problème combinatoire Traitement parallèle
Keyword (en)
Parallel algorithms Graph Combinatorial problem Parallel processing
Keyword (es)
Grafo Problema combinatorio Tratamiento paralelo
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

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
2600513

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