bokomslag Theoretical Computer Science and Discrete Mathematics
Data & IT

Theoretical Computer Science and Discrete Mathematics

S Arumugam Jay Bagga Lowell W Beineke B S Panda

Pocket

759:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-16 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 458 sidor
  • 2017
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.
  • Författare: S Arumugam, Jay Bagga, Lowell W Beineke, B S Panda
  • Illustratör: Bibliographie
  • Format: Pocket/Paperback
  • ISBN: 9783319644189
  • Språk: Engelska
  • Antal sidor: 458
  • Utgivningsdatum: 2017-08-17
  • Förlag: Springer International Publishing AG