Zobrazeno 1 - 10
of 153
pro vyhledávání: '"largest induced subgraph"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
[Research Report] Inria; I3S; Université Côte d'Azur. 2021
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2022
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2022, Jun 2022, Torshavn, Faroe Islands. ⟨10.4230/LIPIcs.SWAT.2022.23⟩
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2022
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2022, Jun 2022, Torshavn, Faroe Islands. ⟨10.4230/LIPIcs.SWAT.2022.23⟩
If a graph G is such that no two adjacent vertices of G have the same degree, we say that G is locally irregular. In this work we introduce and study the problem of identifying a largest induced subgraph of a given graph G that is locally irregular.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8aad280c8db6a41199f6ce60306b74a1
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Luo, Junjie1,2,3 (AUTHOR) junjie.luo@campus.tu-berlin.de, Molter, Hendrik1 (AUTHOR), Suchý, Ondřej4 (AUTHOR)
Publikováno v:
Theory of Computing Systems. Nov2021, Vol. 65 Issue 8, p1243-1282. 40p.
Autor:
D'Elia, Marco, Frati, Fabrizio
In this paper, we study the following question. Let $\mathcal G$ be a family of planar graphs and let $k\geq 3$ be an integer. What is the largest value $f_k(n)$ such that every $n$-vertex graph in $\mathcal G$ has an induced subgraph with degree at
Externí odkaz:
http://arxiv.org/abs/2412.14784
Publikováno v:
SIAM Journal on Discrete Mathematics; 2022, Vol. 36 Issue 4, p2453-2472, 20p
Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph.
Autor:
Stanić, Zoran1 (AUTHOR) zstanic@matf.bg.ac.rs
Publikováno v:
Discrete Applied Mathematics. Dec2023, Vol. 340, p32-40. 9p.
Publikováno v:
SIAM Journal on Discrete Mathematics; 2021, Vol. 35 Issue 4, p2357-2386, 30p
Autor:
Belmonte, Rémy, Sau, Ignasi
Publikováno v:
Algorithmica; Aug2021, Vol. 83 Issue 8, p2351-2373, 23p
Autor:
Lima, Paloma T., Milanič, Martin, Muršič, Peter, Okrasa, Karolina, Rzążewski, Paweł, Štorgel, Kenny
For a tree decomposition $\mathcal{T}$ of a graph $G$, by $\mu(\mathcal{T})$ we denote the size of a largest induced matching in $G$ all of whose edges intersect one bag of $\mathcal{T}$. Induced matching treewidth of a graph $G$ is the minimum value
Externí odkaz:
http://arxiv.org/abs/2402.15834