Locating and repairing faults in a network with mobile agents (Q962168): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132927293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomization helps to perform independent tasks reliably / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating and Repairing Faults in a Network with Mobile Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for a Black Hole in Synchronous Tree Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black hole search in common interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for a black hole in arbitrary networks: optimal mobile agents protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile search for a black hole in an anonymous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black Hole Search in Asynchronous Rings Using Tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performing Work Efficiently in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective tree exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and approximation results for black hole search in arbitrary networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation bounds for Black Hole Search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:23, 2 July 2024

scientific article
Language Label Description Also known as
English
Locating and repairing faults in a network with mobile agents
scientific article

    Statements

    Locating and repairing faults in a network with mobile agents (English)
    0 references
    0 references
    0 references
    0 references
    6 April 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    graph exploration
    0 references
    mobile agents
    0 references
    distributed computing
    0 references
    0 references