1 paper
Girish Balakrishnan, Sankardeep Chakraborty, N S Narayanaswamy +1
We improve the worst-case information theoretic lower bound of Munro and Wu (ISAAC 2018) for n−vertex unlabeled chordal graphs when vertex leafage is bounded and leafage is unbou…