Titlebook: Combinatorial Algorithms; 30th International W Charles J. Colbourn,Roberto Grossi,Nadia Pisanti Conference proceedings 2019 Springer Nature

STAT

膽汁

發(fā)酵劑

A Note on Handicap Incomplete Tournaments, of a .(.,?.). In this paper, we give a method to construct new .-handicap graphs from .-handicap graphs for all . and as an application, we characterize the .-handicap labeling of Hamming graphs. Further, we give another method to construct .(.,?.) from an infinite class of .(.,?.) by increasing the number of rounds in .(.,?.).

FLOAT

,Algorithm and Hardness Results on Liar’s Dominating Set and ,-tuple Dominating Set, show a . bits lower bound for the space complexity of any (randomized) streaming algorithm for Liar’s dominating set problem as well as for the .-tuple dominating set problem. Furthermore, we prove that the Liar’s dominating set problem on bipartite graphs is W[2]-hard.

Infirm

Reaching 3-Connectivity via Edge-Edge Additions,nted graph..As a relevant application, we show how to exploit this augmentation technique to extend some classical .-hardness results for bounded-degree 2-connected planar graphs to bounded-degree 3-connected planar graphs.

Delectable

Cops and Robber on Some Families of Oriented Graphs, . if Player?1 playing with a single cop has a winning strategy. In this article, we study the three models on some families of oriented graphs and characterize the cop-win directed graphs for the third model.