|
|
|
|
| LEADER |
01770cam a22003617a 4500 |
| 008 |
120905t20132013nyua b 001 0 eng d |
| 999 |
|
|
|c 136046
|d 136046
|
| 010 |
|
|
|a 2012948679
|
| 016 |
7 |
|
|a 016206426
|2 Uk
|
| 020 |
|
|
|a 9781461452416 (alk. paper)
|
| 020 |
|
|
|a 1461452414 (alk. paper)
|
| 020 |
|
|
|z 9781461452423 (ebk.)
|
| 035 |
|
|
|a (OCoLC)ocn829118904
|
| 042 |
|
|
|a lccopycat
|
| 082 |
0 |
4 |
|a 511.5
|2 23
|
| 100 |
1 |
|
|a Du, Dingzhu.
|
| 245 |
1 |
0 |
|a Connected dominating set :
|b theory and applications /
|c Ding-Zhu Du, Peng-Jun Wan.
|
| 260 |
|
|
|a New York:
|b Springer,
|c 2013.
|
| 300 |
|
|
|a ix, 203 pages :
|b illustrations (some color) ;
|c 24 cm.
|
| 490 |
1 |
|
|a Springer optimization and its applications,
|x 1931-6828 ;
|v v. 77
|
| 504 |
|
|
|a Includes bibliographical references (pages 193-199) and index.
|
| 505 |
0 |
|
|a Introduction -- CDS in General Graph -- CDS in Unit Disk Graph -- CDS in Unit Ball Graphs and Growth Bounded Graphs -- Weighted CDS in Unit Disk Graph -- Coverage -- Routing-Cost Constrained CDS -- CDS in Disk-Containment Graphs -- CDS in Disk-Intersection Graphs -- Geometric Hitting Set and Disk Cover -- Minimum-Latency Scheduling -- CDS in Planar Graphs.
|
| 650 |
|
0 |
|a Domination (Graph theory)
|
| 650 |
|
0 |
|a Set theory.
|
| 650 |
|
7 |
|a Domination (Graph theory)
|2 fast
|
| 650 |
|
7 |
|a Set theory.
|2 fast
|
| 700 |
1 |
|
|a Wan, Peng-Jun,
|e Author.
|
| 942 |
|
|
|c BK
|
| 830 |
|
0 |
|a Springer optimization and its applications ;
|v v. 77.
|
| 906 |
|
|
|a 7
|b cbc
|c copycat
|d 2
|e epcn
|f 20
|g y-gencatlg
|
| 955 |
|
|
|b rl09 2014-11-24 z-processor
|i rl09 2014-11-26 ; to CALM
|
| 955 |
|
|
|a pc25 2012-09-05
|a xh00 2013-02-15 USPL/STM
|a xh00 2013-02-22 added copy to STM
|
| 952 |
|
|
|0 0
|1 0
|4 0
|7 0
|9 150593
|a MAT
|b MAT
|c ST1
|d 2016-07-26
|g 2127.87
|i 6826
|l 0
|p MAT6826
|r 2016-07-26
|w 2016-07-26
|y BK
|