DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS (Q3444846): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57832117, #quickstatements; #temporary_batch_1711031506070 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Efficient elections in chordal ring networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The vertex separation and search number of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Searching and pebbling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recontamination does not help to search a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal distributed algorithms in unlabeled tori and chordal rings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of searching a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Min Cut is NP-complete for edge weighted trees / rank | |||
Normal rank | |||
Latest revision as of 20:37, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS |
scientific article |
Statements
DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS (English)
0 references
5 June 2007
0 references
asynchronous chordal ring networks
0 references
