Theoretical Computer Science and Discrete Mathematics

丛 书 名：Lecture Notes in Computer Science

版本说明：1

作     者：S. Arumugam Jay Bagga Lowell W. Beineke B.S. Panda 

I S B N：(纸本) 9783319644189 

出 版 社：Springer Cham 

出 版 年：1000年

页      数：XIII, 458页

主 题 词：Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Data Structures Computer Imaging, Vision, Pattern Recognition and Graphics Systems and Data Security Artificial Intelligence 

摘      要：This volume constitutes the refereed post-conference proceedings of the International Conference on Theoretical Computer Science and Discrete Mathematics, held in Krishnankoil, India, in December 2016.;The 57 revised full papers were carefully reviewed and selected from 210 submissions. The papers cover a broad range of topics such as line graphs and its generalizations, large graphs of given degree and diameter, graphoidal covers, adjacency spectrum, distance spectrum, b-coloring, separation dimension of graphs and hypergraphs, domination in graphs, graph labeling problems, subsequences of words and Parike matrices, lambda-design conjecture, graph algorithms and interference model for wireless sensor networks.