A dichotomy for minimum cost graph homomorphisms
European Journal of Combinatorics
Random Generation and Enumeration of Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Linear-time certifying recognition algorithms and forbidden induced subgraphs
Nordic Journal of Computing
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Bipartite permutation graphs are reconstructible
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Powers of cycles, powers of paths, and distance graphs
Discrete Applied Mathematics
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Certifying algorithms for the path cover and related problems on interval graphs
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
Computer Science Review
An O(nm)-time certifying algorithm for recognizing HHD-free graphs
Theoretical Computer Science
| Hi-index | 0.00 |
A "partial broadcast channel" enables one processor to send the same message---simultaneously and privately---to a fixed subset of processors. Suppose that a collection of processors are connected by an arbitrary network of partial broadcast channels ...