Search

Your search keyword '"Subramanian, C. R."' showing total 105 results
Start Over Author "Subramanian, C. R."
105 results on '"Subramanian, C. R."'

101. Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs

Author

Padamutham, Chakradhar, Palagiri, Venkata Subba Reddy, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Mudgal, Apurva, editor, and Subramanian, C. R., editor

Published
2021
Full Text
View/download PDF

102. Scheduling Trains with Small Stretch on a Unidirectional Line

Author

Garg, Apoorv, Ranade, Abhiram, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Mudgal, Apurva, editor, and Subramanian, C. R., editor

Published
2021
Full Text
View/download PDF

103. Online Bin Packing with Overload Cost

Author

Luo, Kelin, Spieksma, Frits C. R., Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Mudgal, Apurva, editor, and Subramanian, C. R., editor

Published
2021
Full Text
View/download PDF

104. ORIENTED COLOURING OF SOME GRAPH PRODUCTS.

Author

ARAVIND, N. R., NARAYANAN, N., and SUBRAMANIAN, C. R.

Subjects
*GRAPH coloring, *GRAPH theory, *DIRECTED graphs, *HOMOMORPHISMS, *WIRELESS sensor networks, *PATHS & cycles in graph theory, *COMBINATORICS
Abstract

We obtain some improved upper and lower bounds on the oriented chromatic number for different classes of products of graphs. [ABSTRACT FROM AUTHOR]

Published
2011
Full Text
View/download PDF

105. ON k-INTERSECTION EDGE COLOURINGS.

Author

Muthu, Rahul, Narayanan, N., and Subramanian, C. R.

Subjects
*INTERSECTION graph theory, *HYPERGRAPHS, *DIRECTED graphs, *DYNAMIC programming, *PROBABILISTIC number theory
Abstract

We propose the following problem. For some k ⩾ 1, a graph G is to be properly edge coloured such that any two adjacent vertices share at most k colours. We call this the k-intersection edge colouring. The minimum number of colours sufficient to guarantee such a colouring is the k-intersection chromatic index and is denoted χ′k(G). Let fk be defined by fk(Δ) = (These character(s) cannot be represented in ASCII text). We show that (These character(s) cannot be represented in ASCII text). We also discuss some open problems. [ABSTRACT FROM AUTHOR]

Published
2009
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results