Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Recognizing locally equivalent graphs

Author
BOUCHET, A
Univ. Maine, cent. rech. infor. combin., 72017 Le Mans, France
Conference title
Combinatorics and algorithms. French-Israeli conference
Conference name
Combinatorics and algorithms. French-Israeli conference (Jerusalem 1988-11-13)
Author (monograph)
FRAENKEL, A. S (Editor)1 ; ALON, N (Editor); GOLUMBIC, M. C (Editor); SHAMIR, E (Editor)
Israeli Ministry of Science. National Council for Research and Development, Israel (Funder/Sponsor)
French Ministry of Foreign Affairs. Department of Science and Technology, Paris, France (Funder/Sponsor)
[1] Weizmann inst. sci., dep. applied mathematics, 76100 Rehovot, Israel
Source

Discrete mathematics. 1993, Vol 114, Num 1-3, pp 75-86 ; ref : 15 ref

CODEN
DSMHA4
ISSN
0012-365X
Scientific domain
Computer science; Mathematics
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Conference Paper
Language
English
Keyword (fr)
Algorithme Complémentation Comptage Invariant Reconnaissance Sous graphe Temps polynomial Equivalence locale Graphe simple
Keyword (en)
Algorithm Complementation Counting Invariant Recognition Subgraph Polynomial time Simple graph
Keyword (es)
Algoritmo Complementación Contaje Invariante Reconocimiento Subgrafo Tiempo polinomial
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics / 001A02B01C Graph theory

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
3952442

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