Algorithms and Discrete Applied Mathematics : 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020, Proceedings / edited by Manoj Changat, Sandip Das.

Format:

Book

Contributor:

Changat, Manoj, Editor.

Das, Sandip, Editor.

SpringerLink (Online service)

Series:

Computer Science (SpringerNature-11645)

LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12016

Theoretical Computer Science and General Issues, 2512-2029 ; 12016

Language:

English

Subjects (All):

Mathematics-Data processing.

Computer science-Mathematics.

Computer science.

Data structures (Computer science).

Information theory.

Computational Mathematics and Numerical Analysis.

Mathematics of Computing.

Theory of Computation.

Data Structures and Information Theory.

Local Subjects:

Computational Mathematics and Numerical Analysis.

Mathematics of Computing.

Theory of Computation.

Data Structures and Information Theory.

Physical Description:

1 online resource (XX, 490 pages) : 151 illustrations, 36 illustrations in color.

Edition:

1st ed. 2020.

Contained In:

Springer Nature eBook

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2020.

System Details:

text file PDF

Summary:

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.

Contents:

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. .

Other Format:

Printed edition:

ISBN:

978-3-030-39219-2

9783030392192

Access Restriction:

Restricted for use by site license.