X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
covering with paths (3) 3
fpt-algorithm (3) 3
monomial (3) 3
np-hardness (3) 3
algorithms (2) 2
computer science (2) 2
computer science, theory & methods (2) 2
mathematics - combinatorics (2) 2
agents (1) 1
approximation algorithms (1) 1
complexity (1) 1
computer and information science (1) 1
computer science - discrete mathematics (1) 1
computer science, hardware & architecture (1) 1
connected graph searching (1) 1
connected pathwidth (1) 1
connected search (1) 1
coordinates (1) 1
data- och informationsvetenskap (1) 1
datavetenskap (1) 1
digraphs (1) 1
distributed searching (1) 1
efficient (1) 1
faster (1) 1
graph minors (1) 1
graph searching (1) 1
hardness (1) 1
information science (1) 1
lower bounds (1) 1
natural sciences (1) 1
naturvetenskap (1) 1
nodes (1) 1
on-line searching (1) 1
partial grid (1) 1
pathwidth (1) 1
pursuit-evasion (1) 1
search algorithms (1) 1
strategy (1) 1
technology (1) 1
teknikvetenskap (1) 1
theory of computation (1) 1
treewidth (1) 1
two dimensional models (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Theory of Computing Systems, ISSN 1432-4350, 11/2019, Volume 63, Issue 8, pp. 1819 - 1848
We consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their... 
Connected search | Computer Science | On-line searching | Theory of Computation | Distributed searching | Pursuit-evasion | Partial grid | Agents (artificial intelligence) | Lower bounds | Algorithms | Search algorithms | Coordinates | Two dimensional models | Strategy | Nodes
Journal Article
Journal of Computer and System Sciences, ISSN 0022-0000, 06/2019, Volume 102, pp. 57 - 68
We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the... 
NP-hardness | Monomial | Covering with paths | FPT-algorithm
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 11/2019, Volume 794, pp. 85 - 100
A connected path decomposition of a simple graph G is a path decomposition (X1,…,Xl) such that the subgraph of G induced by X1∪⋯∪Xi is connected for each... 
Graph searching | Connected pathwidth | Pathwidth | Connected graph searching | APPROXIMATION ALGORITHMS | TREEWIDTH | FASTER | GRAPH MINORS | COMPUTER SCIENCE, THEORY & METHODS | EFFICIENT | Information science
Journal Article
Journal of Computer and System Sciences, ISSN 0022-0000, 06/2019, Volume 102, pp. 57 - 68
Journal Article
05/2017
A group of mobile agents is given a task to explore an edge-weighted graph $G$, i.e., every vertex of $G$ has to be visited by at least one agent. There is no... 
Journal Article
Journal of Computer and System Sciences, ISSN 0022-0000, 2019, Volume 102
We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the... 
NP-hardness | TEKNIKVETENSKAP | FPT-algorithm | Monomial | Covering with paths | TECHNOLOGY
Journal Article
02/2017
Let $D=(V,A)$ be a digraph. A subset $S$ of $V$ is called a twin dominating set of $D$ if for every vertex $v\in V-S$, there exists vertices $u_1,u_2 \in S$... 
Mathematics - Combinatorics
Journal Article
02/2018
A connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup... 
Journal Article
02/2019
In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be... 
Mathematics - Combinatorics
Journal Article
12/2017
We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the... 
Computer Science - Discrete Mathematics
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.