Výsledky vyhledávání

An $f$-edge (or vertex) connectivity certificate is a sparse subgraph that maintains connectivity under the failure of at most $f$ edges (or vertices). It is well known that any $n$-vertex graph admits an $f$-edge (or vertex) connectivity certificate

Externí odkaz: http://arxiv.org/abs/2411.11054

Zobrazit plný text záznamu

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.

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.

Akademický článek

FLASH radiotherapy using high-energy X-rays: Current status of PARTER platform in FLASH research.

Autor: Yang Y; Institute of Applied Electronics, China Academy of Engineering Physics, Mianyang 621900, China., Wang J; Institute of Applied Electronics, China Academy of Engineering Physics, Mianyang 621900, China., Gao F; Department of Oncology, NHC Key Laboratory of Nuclear Technology Medical Transformation (Mianyang Central Hospital), Mianyang Central Hospital, School of Medicine, University of Electronic Science and Technology, Mianyang 621000, China., Liu Z; Department of Radiotherapy Physics & Technology, West China Hospital, Sichuan University, Chengdu 610041, China., Dai T; Department of Oncology, NHC Key Laboratory of Nuclear Technology Medical Transformation (Mianyang Central Hospital), Mianyang Central Hospital, School of Medicine, University of Electronic Science and Technology, Mianyang 621000, China., Zhang H; School of Radiation Medicine and Protection, Suzhou Medical College of Soochow University, Suzhou 215123, China., Zhu H; Department of Radiation Oncology, State Key Laboratory of Oncology in South China, Sun Yat-sen University Cancer Center, Guangzhou 510060, China., Wang T; Department of Oncology, NHC Key Laboratory of Nuclear Technology Medical Transformation (Mianyang Central Hospital), Mianyang Central Hospital, School of Medicine, University of Electronic Science and Technology, Mianyang 621000, China., Xiao D; Institute of Applied Electronics, China Academy of Engineering Physics, Mianyang 621900, China., Zhou K; Institute of Applied Electronics, China Academy of Engineering Physics, Mianyang 621900, China., Zhou Z; Institute of Applied Electronics, China Academy of Engineering Physics, Mianyang 621900, China., Wu D; Institute of Applied Electronics, China Academy of Engineering Physics, Mianyang 621900, China., Du X; Department of Oncology, NHC Key Laboratory of Nuclear Technology Medical Transformation (Mianyang Central Hospital), Mianyang Central Hospital, School of Medicine, University of Electronic Science and Technology, Mianyang 621000, China. Electronic address: duxiaobo2005@126.com., Bai S; Department of Radiotherapy Physics & Technology, West China Hospital, Sichuan University, Chengdu 610041, China. Electronic address: winfield1920@126.com.

Publikováno v: Radiotherapy and oncology : journal of the European Society for Therapeutic Radiology and Oncology [Radiother Oncol] 2023 Oct 27, pp. 109967. Date of Electronic Publication: 2023 Oct 27.

Zobrazit plný text záznamu

Report

Distributed Maximum Flow in Planar Graphs

Autor: Abd-Elhaleem, Yaseen, Dory, Michal, Parter, Merav, Weimann, Oren

The dual of a planar graph $G$ is a planar graph $G^*$ that has a vertex for each face of $G$ and an edge for each pair of adjacent faces of $G$. The profound relationship between a planar graph and its dual has been the algorithmic basis for solving

Externí odkaz: http://arxiv.org/abs/2411.11718

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání