소장자료
| LDR | 04159nam a22005655i 4500 | ||
| 001 | 0100775873▲ | ||
| 003 | DE-He213▲ | ||
| 005 | 20231018113653▲ | ||
| 007 | cr nn 008mamaa▲ | ||
| 008 | 220116s2022 sz | s |||| 0|eng d▲ | ||
| 020 | ▼a9783030950187▼9978-3-030-95018-7▲ | ||
| 024 | 7 | ▼a10.1007/978-3-030-95018-7▼2doi▲ | |
| 050 | 4 | ▼aQA76.9.M35▲ | |
| 082 | 0 | 4 | ▼a004.0151▼223▲ |
| 245 | 1 | 0 | ▼aAlgorithms and Discrete Applied Mathematics▼h[electronic resource] :▼b8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings /▼cedited by Niranjan Balachandran, R. Inkulu.▲ |
| 250 | ▼a1st ed. 2022.▲ | ||
| 264 | 1 | ▼aCham :▼bSpringer International Publishing :▼bImprint: Springer,▼c2022.▲ | |
| 300 | ▼aXIX, 317 p. 55 illus.▼bonline resource.▲ | ||
| 336 | ▼atext▼btxt▼2rdacontent▲ | ||
| 337 | ▼acomputer▼bc▼2rdamedia▲ | ||
| 338 | ▼aonline resource▼bcr▼2rdacarrier▲ | ||
| 347 | ▼atext file▼bPDF▼2rda▲ | ||
| 490 | 1 | ▼aTheoretical Computer Science and General Issues,▼x2512-2029 ;▼v13179▲ | |
| 505 | 0 | ▼aA proof of the Multiplicative 1-2-3 Conjecture -- The geodesic transversal problem on some networks -- Chromatic Bounds for Some Subclasses of $(P_3₩cup P_2)$-free Graphs -- List homomorphisms to separable signed graphs -- Some position problems for graphs -- Comparability graphs among Cover-Incomparability graphs -- Complexity of Paired Domination in AT-free and Planar Graphs -- The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs -- On Conflict-Free Spanning Tree: Algorithms and Complexity -- B0-VPG Representation of AT-free Outerplanar Graphs -- P versus NPC : Steiner tree in convex split graphs -- On cd-coloring of {P_5,K_4}-free chordal graphs -- An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs -- Covering a Graph with Densest Subgraphs -- Coresets for $(k, ₩ell)$-Median Clustering under the Fréchet Distance -- Bounds and Algorithms for Geodetic Hulls -- Voronoi Games using Geodesics -- Approximation and parameterized algorithms for balanced connected partition problems -- Algorithms for Online Car-sharing Problem -- Algebraic algorithms for variants of Subset Sum -- Hardness and Approximation Results for Some Variants of Stable Marriage Problem -- On Fair Division with Binary Valuations Respecting Social Networks -- Parameterized Intractability of Defensive Alliance Problem -- On the approximability of path and cycle problems in arc-dependent networks} -- Approximation Algorithms in Graphs with Known Broadcast time of the Base Graph.▲ | |
| 520 | ▼aThis book constitutes the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022, which was held in Puducherry, India, during February 10-12, 2022. The 24 papers presented in this volume were carefully reviewed and selected from 80 submissions. The papers were organized in topical sections named: graph theory, graph algorithms, computational geometry, algorithms and optimization.▲ | ||
| 650 | 0 | ▼aComputer science—Mathematics.▲ | |
| 650 | 0 | ▼aAlgorithms.▲ | |
| 650 | 0 | ▼aData structures (Computer science).▲ | |
| 650 | 0 | ▼aInformation theory.▲ | |
| 650 | 0 | ▼aDiscrete mathematics.▲ | |
| 650 | 1 | 4 | ▼aMathematics of Computing.▲ |
| 650 | 2 | 4 | ▼aAlgorithms.▲ |
| 650 | 2 | 4 | ▼aData Structures and Information Theory.▲ |
| 650 | 2 | 4 | ▼aDiscrete Mathematics in Computer Science.▲ |
| 700 | 1 | ▼aBalachandran, Niranjan.▼eeditor.▼4edt▼4http://id.loc.gov/vocabulary/relators/edt▲ | |
| 700 | 1 | ▼aInkulu, R.▼eeditor.▼4edt▼4http://id.loc.gov/vocabulary/relators/edt▲ | |
| 710 | 2 | ▼aSpringerLink (Online service)▲ | |
| 773 | 0 | ▼tSpringer Nature eBook▲ | |
| 776 | 0 | 8 | ▼iPrinted edition:▼z9783030950170▲ |
| 776 | 0 | 8 | ▼iPrinted edition:▼z9783030950194▲ |
| 830 | 0 | ▼aTheoretical Computer Science and General Issues,▼x2512-2029 ;▼v13179▲ | |
| 856 | 4 | 0 | ▼uhttps://doi.org/10.1007/978-3-030-95018-7▲ |
Algorithms and Discrete Applied Mathematics[electronic resource] : 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings
자료유형
국외eBook
서명/책임사항
Algorithms and Discrete Applied Mathematics [electronic resource] : 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings / edited by Niranjan Balachandran, R. Inkulu.
판사항
1st ed. 2022.
형태사항
XIX, 317 p. 55 illus. online resource.
총서사항
Theoretical Computer Science and General Issues , 2512-2029 ; 13179
Theoretical Computer Science and General Issues , 2512-2029 ; 13179
Theoretical Computer Science and General Issues , 2512-2029 ; 13179
내용주기
A proof of the Multiplicative 1-2-3 Conjecture -- The geodesic transversal problem on some networks -- Chromatic Bounds for Some Subclasses of $(P_3\cup P_2)$-free Graphs -- List homomorphisms to separable signed graphs -- Some position problems for graphs -- Comparability graphs among Cover-Incomparability graphs -- Complexity of Paired Domination in AT-free and Planar Graphs -- The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs -- On Conflict-Free Spanning Tree: Algorithms and Complexity -- B0-VPG Representation of AT-free Outerplanar Graphs -- P versus NPC : Steiner tree in convex split graphs -- On cd-coloring of {P_5,K_4}-free chordal graphs -- An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs -- Covering a Graph with Densest Subgraphs -- Coresets for $(k, \ell)$-Median Clustering under the Fréchet Distance -- Bounds and Algorithms for Geodetic Hulls -- Voronoi Games using Geodesics -- Approximation and parameterized algorithms for balanced connected partition problems -- Algorithms for Online Car-sharing Problem -- Algebraic algorithms for variants of Subset Sum -- Hardness and Approximation Results for Some Variants of Stable Marriage Problem -- On Fair Division with Binary Valuations Respecting Social Networks -- Parameterized Intractability of Defensive Alliance Problem -- On the approximability of path and cycle problems in arc-dependent networks} -- Approximation Algorithms in Graphs with Known Broadcast time of the Base Graph.
요약주기
This book constitutes the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022, which was held in Puducherry, India, during February 10-12, 2022. The 24 papers presented in this volume were carefully reviewed and selected from 80 submissions. The papers were organized in topical sections named: graph theory, graph algorithms, computational geometry, algorithms and optimization.
주제
ISBN
9783030950187
관련 인기대출 도서