東華大學圖書館 |

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 /
其他題名:	CALDAM 2020
其他作者:	Changat, Manoj.
團體作者:	CALDAM (Conference)
出版者:	Cham :Springer International Publishing : : 2020.,
面頁冊數:	xx, 490 p. :ill. (some col.), digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Computer science - 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] :CALDAM 2020edited by Manoj Changat, Sandip Das. - Cham :Springer International Publishing :2020. - xx, 490 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,120160302-9743 ;. - Lecture notes in computer science ;12016..

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:

678603
Computer science
--Mathematics

LC Class. No.: QA76.9.M35 / C35 2020

Dewey Class. No.: 518

Algorithms and discrete applied mathematics = 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020 : proceedings /
LDR:03888nmm a2200361 a 4500 001 2215546
003 DE-He213
005 20200125003007.0
006 m d
007 cr nn 008maaau
008 201120s2020 sz s 0 eng d
020 $a 9783030392192 $q (electronic bk.)
020 $a 9783030392185 $q (paper)
024 7 $a 10.1007/978-3-030-39219-2 $2 doi
035 $a 978-3-030-39219-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35 $b C35 2020
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
090 $a QA76.9.M35 $b C145 2020
111 2 $a CALDAM (Conference) $n (6th : $d 2020 : $c Hyderabad, India) $3 3447161
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.
246 3 $a CALDAM 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xx, 490 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12016
490 1 $a Theoretical computer science and general issues
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 science $x Mathematics $x Congresses. $3 678603
650 0 $a Algorithms $v Congresses. $3 607038
650 0 $a Computers. $3 544777
650 0 $a Data structures (Computer science) $3 527210
650 1 4 $a Computational Mathematics and Numerical Analysis. $3 891040
650 2 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Data Structures and Information Theory. $3 3382368
700 1 $a Changat, Manoj. $3 3447162
700 1 $a Das, Sandip. $3 1002468
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 12016. $3 3447163
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-39219-2
950 $a Computer Science (Springer-11645)