國立虎尾科技大學 |

Algorithms and Discrete Applied Mathematics = 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithms and Discrete Applied Mathematics/ edited by Manoj Changat, Sandip Das.
其他題名:	6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings /
其他作者:	Changat, Manoj.
面頁冊數:	XX, 490 p. 151 illus., 36 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer mathematics. -
電子資源:	https://doi.org/10.1007/978-3-030-39219-2
ISBN:	9783030392192

Algorithms and Discrete Applied Mathematics = 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings /
Algorithms and Discrete Applied Mathematics6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings /[electronic resource] :edited by Manoj Changat, Sandip Das. - 1st ed. 2020. - XX, 490 p. 151 illus., 36 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12016. - Theoretical Computer Science and General Issues ;9163.

0-1 Timed Matching in Bipartite Temporal Graphs -- Partitioning cographs into two forests and one independent set -- Monitoring the edges of a graph using distances -- Forbidden structure characterization of graphs having a threshold cover of size two: a simpler proof using the lexicographic method -- Approximating Modular Decomposition is Hard -- Vertex Edge Dominating Set in Unit Disk Graphs -- Geometric Planar Networks on Bichromatic Points -- Algorithmic Aspects of Global Total k-Domination in Graphs -- Hardness and approximation for the geodetic set problem in some graph classes -- Maximum Weighted Edge Biclique Problem on Bipartite Graphs -- Determining Number of Generalized and Double Generalized Petersen Graph -- Self-centeredness of generalized Petersen Graphs -- Weak Roman Bondage Number of a Graph -- On the geodetic and hull numbers of shadow Graphs -- Indicated coloring of complete expansion and lexicographic product of graphs -- Smallest C2l+1-critical graphs of odd-girth 2k + 1 -- Ramsey Numbers for Line Graphs -- On Cartesian products of signed graphs -- List distinguishing number of pth power of hypercube and Cartesian powers of a graph -- On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs -- On the relative oriented clique number of planar graphs -- On the minimmum satisfiability problem -- Waiting for Trains: Complexity Results -- Oriented Diameter of Star Graphs -- Gathering over Meeting Nodes of Infinite Grid -- 0-1 Timed Matching in Bipartite Temporal Graphs -- Arbitrary Pattern Formation by Opaque Fat Robots with Lights -- Greedy universal cycle constructions for weak orders -- A New Model in Firefighting Theory -- An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties -- Overlaying a hypergraph with a graph with bounded maximum degree -- Parameterized Algorithms for Directed Modular Width -- On the Complexity of Spanning Trees with a Small Vertex Cover -- Minimum Conflict free Colouring Parameterized by Treewidth -- Planar projections of graphs -- New Algorithms and Bounds for Halving Pseudolines -- Algorithms for Radon Partitions with Tolerance. .

This book constitutes the proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020, held in Hyderabad, India, in February 2020. The 38 papers presented together with 2 invited talks in this volume were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on graph algorithms, graph theory, combinatorial optimization, distributed algorithms, combinatorial algorithms, and computational complexity.

ISBN: 9783030392192

Standard No.: 10.1007/978-3-030-39219-2doiSubjects--Topical Terms:

1199796
Computer mathematics.

LC Class. No.: QA71-90

Dewey Class. No.: 518

Algorithms and Discrete Applied Mathematics = 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings /
LDR:04144nam a22004095i 4500 001 1018850
003 DE-He213
005 20200629121115.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030392192 $9 978-3-030-39219-2
024 7 $a 10.1007/978-3-030-39219-2 $2 doi
035 $a 978-3-030-39219-2
050 4 $a QA71-90
072 7 $a PBKS $2 bicssc
072 7 $a MAT006000 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 518 $2 23
245 1 0 $a Algorithms and Discrete Applied Mathematics $h [electronic resource] : $b 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings / $c edited by Manoj Changat, Sandip Das.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XX, 490 p. 151 illus., 36 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 12016
505 0 $a 0-1 Timed Matching in Bipartite Temporal Graphs -- Partitioning cographs into two forests and one independent set -- Monitoring the edges of a graph using distances -- Forbidden structure characterization of graphs having a threshold cover of size two: a simpler proof using the lexicographic method -- Approximating Modular Decomposition is Hard -- Vertex Edge Dominating Set in Unit Disk Graphs -- Geometric Planar Networks on Bichromatic Points -- Algorithmic Aspects of Global Total k-Domination in Graphs -- Hardness and approximation for the geodetic set problem in some graph classes -- Maximum Weighted Edge Biclique Problem on Bipartite Graphs -- Determining Number of Generalized and Double Generalized Petersen Graph -- Self-centeredness of generalized Petersen Graphs -- Weak Roman Bondage Number of a Graph -- On the geodetic and hull numbers of shadow Graphs -- Indicated coloring of complete expansion and lexicographic product of graphs -- Smallest C2l+1-critical graphs of odd-girth 2k + 1 -- Ramsey Numbers for Line Graphs -- On Cartesian products of signed graphs -- List distinguishing number of pth power of hypercube and Cartesian powers of a graph -- On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs -- On the relative oriented clique number of planar graphs -- On the minimmum satisfiability problem -- Waiting for Trains: Complexity Results -- Oriented Diameter of Star Graphs -- Gathering over Meeting Nodes of Infinite Grid -- 0-1 Timed Matching in Bipartite Temporal Graphs -- Arbitrary Pattern Formation by Opaque Fat Robots with Lights -- Greedy universal cycle constructions for weak orders -- A New Model in Firefighting Theory -- An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties -- Overlaying a hypergraph with a graph with bounded maximum degree -- Parameterized Algorithms for Directed Modular Width -- On the Complexity of Spanning Trees with a Small Vertex Cover -- Minimum Conflict free Colouring Parameterized by Treewidth -- Planar projections of graphs -- New Algorithms and Bounds for Halving Pseudolines -- Algorithms for Radon Partitions with Tolerance. .
520 $a This book constitutes the proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020, held in Hyderabad, India, in February 2020. The 38 papers presented together with 2 invited talks in this volume were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on graph algorithms, graph theory, combinatorial optimization, distributed algorithms, combinatorial algorithms, and computational complexity.
650 0 $a Computer mathematics. $3 1199796
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computers. $3 565115
650 0 $a Data structures (Computer science). $3 680370
650 1 4 $a Computational Mathematics and Numerical Analysis. $3 669338
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Data Structures and Information Theory. $3 1211601
700 1 $a Changat, Manoj. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1313947
700 1 $a Das, Sandip. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 897135
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030392185
776 0 8 $i Printed edition: $z 9783030392208
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-39219-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)