Dorota Osula - Science profile - Bridge of Knowledge

Search

Business contact

Centrum Transferu Wiedzy i Technologii
Location
Al. Zwycięstwa 27, 80-219 Gdańsk
Phone
+48 58 348 62 62
E-mail
biznes@pg.edu.pl

Publication showcase

  • Finding small-width connected path decompositions in polynomial time

    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 X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...

    Full text available to download

  • The complexity of bicriteria tree-depth

    The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...

    Full text to download in external service

  • Multi-agent graph searching and exploration algorithms

    - Year 2020

    A team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...

    Full text available to download

seen 334 times