Zobrazeno 1 - 10
of 212
pro vyhledávání: '"Theory of computation → Graph algorithms analysis"'
Publikováno v:
Theoretical Computer Science. 936:13-32
In a graph G = (V,E) with an edge coloring 𝓁:E → C and two distinguished vertices s and t, a colored (s,t)-cut is a set C̃ ⊆ C such that deleting all edges with some color c ∈ C̃ from G disconnects s and t. Motivated by applications in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7fc5eddb6cac48a4f6ed047154cea6f8
https://doi.org/10.1016/j.tcs.2022.09.013
https://doi.org/10.1016/j.tcs.2022.09.013
Publikováno v:
Algorithmica.
For a non-negative integer $\ell$, a graph $G$ is an $\ell$-leaf power of a tree $T$ if $V(G)$ is equal to the set of leaves of $T$, and distinct vertices $v$ and $w$ of $G$ are adjacent if and only if the distance between $v$ and $w$ in $T$ is at mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae85473080b4236e5623599927b6f62b
https://doi.org/10.1007/s00453-023-01129-9
https://doi.org/10.1007/s00453-023-01129-9
Autor:
Włodarczyk, Michał
In Chordal/Interval Vertex Deletion we ask how many vertices one needs to remove from a graph to make it chordal (respectively: interval). We study these problems under the parameterization by treewidth $tw$ of the input graph $G$. On the one hand, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::246891775064f9c2c59588f76ec4f007
http://arxiv.org/abs/2305.03440
http://arxiv.org/abs/2305.03440
Autor:
Cáceres, Manuel
A minimum chain cover (MCC) of a k-width directed acyclic graph (DAG) G = (V, E) is a set of k chains (paths in the transitive closure) of G such that every vertex appears in at least one chain in the cover. The state-of-the-art solutions for MCC run
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e16cfba3fd9b5888c59ca061ab18081c
http://arxiv.org/abs/2305.02166
http://arxiv.org/abs/2305.02166
Autor:
Azarmehr, Amir, Behnezhad, Soheil
We study the robust communication complexity of maximum matching. Edges of an arbitrary n-vertex graph G are randomly partitioned between Alice and Bob independently and uniformly. Alice has to send a single message to Bob such that Bob can find an (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::048f8d6b9ea963f77444018c8c066b29
http://arxiv.org/abs/2305.01070
http://arxiv.org/abs/2305.01070
Publikováno v:
Algorithmica, 84(11), 3407-3458. Springer
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021
In the ���-Minor-Free Deletion problem one is given an undirected graph G, an integer k, and the task is to determine whether there exists a vertex set S of size at most k, so that G-S contains no graph from the finite family ��� as a min
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::574791961fab792440da5735d78b9f90
https://research.tue.nl/nl/publications/037a5637-ffbf-478d-8d21-5ac08bbf35a2
https://research.tue.nl/nl/publications/037a5637-ffbf-478d-8d21-5ac08bbf35a2
We provide a general framework to exclude parameterized running times of the form O(l^β + n^γ) for problems that have polynomial running time lower bounds under hypotheses from fine-grained complexity. Our framework is based on cross-compositions f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::270f7302a4c97e8c21aea2716932e5bd
http://arxiv.org/abs/2301.00797
http://arxiv.org/abs/2301.00797
Autor:
Cairo, Massimo, Khan, Shahbaz, Rizzi, Romeo, Schmidt, Sebastian, Tomescu, Alexandru I., Zirondelli, Elia C.
Publikováno v:
40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
In a strongly connected graph G = (V,E), a cut arc (also called strong bridge) is an arc e ∈ E whose removal makes the graph no longer strongly connected. Equivalently, there exist u,v ∈ V, such that all u-v walks contain e. Cut arcs are a fundam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99ddfffeda5509ee6d7a231361d80282
Autor:
Kogan, Shimon, Parter, Merav
For a given (possibly weighted) graph G = (V,E), an additive emulator H is a weighted graph in V × V that preserves the (all pairs) G-distances up to a small additive stretch. In their breakthrough result, [Abboud and Bodwin, STOC 2016] ruled out th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68d3babf38fb7ce591579adce43080fd
This paper initializes the study of range subgraph counting and range subgraph listing, both of which are motivated by the significant demands in practice to perform graph analytics on subgraphs pertinent to only selected, as opposed to all, vertices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2118514490b049a4222a67420047ec65