Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Ranking tournaments

Author
ALON, Noga1 2
[1] Schools of Mathematics and Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel
[2] IAS, Princeton, NJ 08540, United States
Source

SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 1, pp 137-142, 6 p ; ref : 8 ref

CODEN
SJDMEC
ISSN
0895-4801
Scientific domain
Control theory, operational research; Computer science; Mathematics
Publisher
Society for Industrial and Applied Mathematics, Philadelphia, PA
Publication country
United States
Document type
Article
Language
English
Author keyword
68R10 feedback arc set problem; 05C20 tournament
Keyword (fr)
Graphe complet Mathématiques discrètes Optimisation Problème NP difficile Rangement Tournoi Problème ensemble arc rétroaction
Keyword (en)
Complete graph Discrete mathematics Optimization NP hard problem Ranking Tournament Feedback arc set problem
Keyword (es)
Grafo completo Matemáticas discretas Optimización Problema NP duro Ordenamiento Torneo
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

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 Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
18555222

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