Zobrazeno 1 - 10
of 8 511
pro vyhledávání: '"A Siani"'
The $d$-Cut problem is to decide if a graph has an edge cut such that each vertex has at most $d$ neighbours at the opposite side of the cut. If $d=1$, we obtain the intensively studied Matching Cut problem. The $d$-Cut problem has been studied as we
Externí odkaz:
http://arxiv.org/abs/2404.11389
A recent paper describes a framework for studying the computational complexity of graph problems on monotone classes, that is those omitting a set of graphs as a subgraph. If the problems lie in the framework, and many do, then the computational comp
Externí odkaz:
http://arxiv.org/abs/2403.00497
Publikováno v:
Journal of Islamic Marketing, 2024, Vol. 15, Issue 9, pp. 2360-2377.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/JIMA-07-2022-0189
Autor:
Francesca Frasca, Elena Verticchio, Emanuela Bosco, Edgars Kuka, Daniel Sang-Hoon Lee, Cecil Krarup Andersen, Chiara Bertolin, Anna Maria Siani
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-14 (2024)
Abstract This research addresses the issue of the heritage preventive conservation in the perspective of energy sustainability, for contributing to the achievement of the Sustainable Development Goals (SDGs) and towards the EU Green Deal. The study a
Externí odkaz:
https://doaj.org/article/f5444a32e104438ba3556ff9f24a5d9f
Autor:
Bodlaender, Hans L., Johnson, Matthew, Martin, Barnaby, Oostveen, Jelle J., Pandey, Sukanya, Paulusma, Daniel, Smith, Siani, van Leeuwen, Erik Jan
We study Steiner Forest on $H$-subgraph-free graphs, that is, graphs that do not contain some fixed graph $H$ as a (not necessarily induced) subgraph. We are motivated by a recent framework that completely characterizes the complexity of many problem
Externí odkaz:
http://arxiv.org/abs/2305.01613
Autor:
Johnson, Matthew, Martin, Barnaby, Pandey, Sukanya, Paulusma, Daniël, Smith, Siani, van Leeuwen, Erik Jan
For any finite set $\mathcal{H} = \{H_1,\ldots,H_p\}$ of graphs, a graph is $\mathcal{H}$-subgraph-free if it does not contain any of $H_1,\ldots,H_p$ as a subgraph. In recent work, meta-classifications have been studied: these show that if graph pro
Externí odkaz:
http://arxiv.org/abs/2305.01104
Publikováno v:
Discover Education, Vol 3, Iss 1, Pp 1-12 (2024)
Abstract In the current post-truth era, the ability to assess the reliability of information is an essential citizenship attribute. With nearly half of the present internet traffic estimated to be generated by bots, and misinformation being regularly
Externí odkaz:
https://doaj.org/article/25123100e46d4139914cc4fc4027c2e3
Publikováno v:
Journal of Economic Geology, Vol 16, Iss 1, Pp 79-112 (2024)
Khosro Abad iron ore deposit is located 130 km of Kermanshah, 30 km northeast of Sonqor city close to Khosro Abad village, in the Sanandaj-Sirjan zone. Based on the field observation, exposed units in the area include; basaltic-andesite volcanic rock
Externí odkaz:
https://doaj.org/article/d942f6d7790f42baa381cac8d593b1fe
Autor:
Lozin, Vadim, Martin, Barnaby, Pandey, Sukanya, Paulusma, Daniel, Siggers, Mark, Smith, Siani, van Leeuwen, Erik Jan
For a fixed set ${\cal H}$ of graphs, a graph $G$ is ${\cal H}$-subgraph-free if $G$ does not contain any $H \in {\cal H}$ as a (not necessarily induced) subgraph. A recently proposed framework gives a complete classification on ${\cal H}$-subgraph-f
Externí odkaz:
http://arxiv.org/abs/2211.14214
Autor:
Johnson, Matthew, Martin, Barnaby, Oostveen, Jelle J., Pandey, Sukanya, Paulusma, Daniël, Smith, Siani, van Leeuwen, Erik Jan
For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be explained
Externí odkaz:
http://arxiv.org/abs/2211.12887