Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

The cluster editing problem : Implementations and experiments

Author
DEHNE, Frank1 ; LANGSTON, Michael A2 ; XUEMEI LUO1 ; PITRE, Sylvain1 ; SHAW, Peter3 ; YUN ZHANG2
[1] School of Computer Science, Carleton University, Ottawa, Canada
[2] Department of Computer Science, University of Tennessee, Knoxville, TN, United States
[3] Department of Computer Science, University of Newcastle, Newcastle, Australia
Conference title
Parameterized and exact computation (Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006)
Conference name
IWPEC (2 ; Zürich 2006)
Author (monograph)
Bodlaender, Hans L (Editor); Langston, Michael A (Editor)
Source

Lecture notes in computer science. 2006 ; 1Vol, pp 13-24, 12 p ; ref : 10 ref

ISSN
0302-9743
ISBN
3-540-39098-7
Scientific domain
Computer science; Transportation
Publisher
Springer, Berlin
Publication country
Germany
Document type
Conference Paper
Language
English
Keyword (fr)
Algorithme glouton Monotonie Méthode calcul Programmation linéaire Ramification
Keyword (en)
Greedy algorithm Monotonicity Computing method Linear programming Branching
Keyword (es)
Algoritmo glotón Monotonía Método cálculo Programación lineal Ramificación
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

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

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