| Description |
1 online resource (xx, 490 pages) : illustrations (some color) |
| Series |
Lecture notes in computer science ; 12016 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 12016.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Part I. Graph algorithims -- Complexity of Restricted Variant of Star Colouring -- Partitioning Cographs into Two Forests and One Independent Set -- Monitoring the Edges of a Graph Using Distances -- The Lexicographic Method for the Threshold Cover Problem -- Approximating Modular Decomposition Is Hard -- Vertex-Edge Domination in Unit Disk Graphs -- Geometric Planar Networks on Bichromatic Points -- Hardness Results of Global Total k-Domination Problem in Graphs -- Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes -- Maximum Weighted Edge Biclique Problem on Bipartite Graphs -- Part II. Graph Theory -- 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 -- List Distinguishing Number of pth Power of Hypercube and Cartesian Powers of a Graph -- On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs -- The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10 -- Part III. Combinatorial Optimization -- On the Minimum Satisfiability Problem -- Waiting for Trains: Complexity Results -- Part IV. Distributed Algorithms -- Oriented Diameter of Star Graphs -- Gathering over Meeting Nodes in Infinite Grid -- 0-1 Timed Matching in Bipartite Temporal Graphs -- Arbitrary Pattern Formation by Opaque Fat Robots with Lights -- Part V. Computational Algorithms -- 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 -- Part VI. Computational complexity -- Overlaying a Hypergraph with a Graph with Bounded Maximum Degree -- Parameterized Algorithms for Directed Modular Width -- On the Parameterized Complexity of Spanning Trees with Small Vertex Covers -- Minimum Conflict Free Colouring Parameterized by Treewidth -- Part VII. Computational Geometry -- Planar Projections of Graphs -- New Algorithms and Bounds for Halving Pseudolines -- Algorithms for Radon Partitions with Tolerance |
| 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 |
| Notes |
International conference proceedings |
|
Includes author index |
| Subject |
Computer science -- Mathematics -- Congresses
|
|
Algorithms -- Congresses
|
|
Computers.
|
|
Data structures (Computer science)
|
|
Computers
|
|
computers.
|
|
Mathematical theory of computation.
|
|
Computer science.
|
|
Algorithms & data structures.
|
|
Numerical analysis.
|
|
Computers -- Data Processing.
|
|
Computers -- Computer Science.
|
|
Computers -- Information Theory.
|
|
Mathematics -- Counting & Numeration.
|
|
Algorithms
|
|
Computer science -- Mathematics
|
|
Computers
|
|
Data structures (Computer science)
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Changat, Manoj, editor
|
|
Das, Sandip, editor
|
| ISBN |
9783030392192 |
|
3030392198 |
|
