EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

On maximal k-edge-connected subgraphs of undirected graphs

Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas, Debasish Pattanayak

Journal of Computer and System Sciences · 2026-09 · 160 · 103801

DOI: 10.1016/j.jcss.2026.103801 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computer and System Sciences, 2026-09. Verfasst von Loukas Georgiadis und 3 weiteren Autor:innen. Die Arbeit nennt 60 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Governo Italiano Ministero dell'Istruzione dell'Universita e della Ricerca, Hellenic Foundation for Research and Innovation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Governo Italiano Ministero dell'Istruzione dell'Universita e della Ricerca
  • Hellenic Foundation for Research and Innovation

Zitieren

APA

Georgiadis, L., Italiano, G. F., Kosinas, E., & Pattanayak, D. (2026). On maximal k-edge-connected subgraphs of undirected graphs. Journal of Computer and System Sciences, 160, 103801. https://doi.org/10.1016/j.jcss.2026.103801

Vancouver

Georgiadis L, Italiano GF, Kosinas E, Pattanayak D. On maximal k-edge-connected subgraphs of undirected graphs. Journal of Computer and System Sciences. 2026;160:103801. doi:10.1016/j.jcss.2026.103801

BibTeX
@article{Georgiadis2026,
  author = {Georgiadis, Loukas and Italiano, Giuseppe F. and Kosinas, Evangelos and Pattanayak, Debasish},
  title = {On maximal k-edge-connected subgraphs of undirected graphs},
  journal = {Journal of Computer and System Sciences},
  year = {2026},
  volume = {160},
  pages = {103801},
  doi = {10.1016/j.jcss.2026.103801}
}
Kostenlos starten →