Recherche
-
Hardness and approximation of Gathering in static radio networks
Communication dans un congrès -
More Efficient Periodic Traversal in Anonymous Undirected Graphs
Communication dans un congrès -
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès -
Brief Announcement: On the Complexity of Distributed Greedy Coloring
Communication dans un congrès -
From Balls and Bins to Points and Vertices
Communication dans un congrès -
Approximation bounds for Black Hole Search problems
Communication dans un congrès -
Searching for black-hole faults in a network using multiple agents
Communication dans un congrès -
Network Verification via Routing Table Queries
Communication dans un congrès -
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Communication dans un congrès -
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality (Extended Abstract)
Communication dans un congrès