Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Algorithms for minimum m-connected k-tuple dominating set problem

Author
WEIPING SHANG1 2 ; PENGJUN WAN3 ; FRANCES YAO2 ; XIAODONG HU1
[1] Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 10080, China
[2] Department of Computer Science, City University of Hong Kong, Hong-Kong
[3] Department of Computer Science, Illinois Institute of Technology, Chicago, IL 60616, United States
Source

Theoretical computer science. 2007, Vol 381, Num 1-3, pp 241-247, 7 p ; ref : 12 ref

CODEN
TCSCDI
ISSN
0304-3975
Scientific domain
Computer science
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Author keyword
Approximation algorithm Connected dominating set Wireless sensor networks k-vertex connectivity
Keyword (fr)
Algorithme approximation Approximation Calcul tolérant les pannes Connectivité graphe Diffusion(télécommunications) Efficacité Ensemble dominant Informatique théorique Monitorage Radiodiffusion Routage Réseau Superficie Tolérance faute Vertex 58A25 68M15 68W25 68Wxx
Keyword (en)
Approximation algorithm Approximation Fault tolerant computing Graph connectivity Broadcasting Efficiency Dominating set Computer theory Monitoring Broadcasting Routing Network Area Fault tolerance Vertex
Keyword (es)
Algoritmo aproximación Aproximación Conectividad grafo Eficacia Conjunto dominando Informática teórica Monitoreo Radiodifusión Enrutamiento Red Superficie Tolerancia falta Vértice
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02G Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds / 001A02G04 Global analysis, analysis on manifolds

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 / 001D02A08 Miscellaneous

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B10 Computer systems performance. Reliability

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

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