Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Shih-Shun Kao"'
Publikováno v:
IEEE Access, Vol 9, Pp 16679-16691 (2021)
A set of the spanning trees in a graph $G$ is called independent spanning trees if they have a common root $r$ and for each vertex $v\in V(G)\setminus \{r\}$ , the paths from $v$ to $r$ in any two trees are directed edge-disjoint and internally verte
Externí odkaz:
https://doaj.org/article/13180a7439f249ae8998ae6cf6bb3713
Publikováno v:
IEEE Access, Vol 8, Pp 112333-112347 (2020)
A set of spanning trees in a graph G is called independent spanning trees (ISTs) if they are rooted at the same vertex r, and for each vertex v(≠ r) in G, the two paths from v to r in any two trees share no common vertex expect for v and r. ISTs ca
Externí odkaz:
https://doaj.org/article/81f947a0890b4df0a3dd6d4f88da8b3b
Publikováno v:
IEEE Access, Vol 7, Pp 110267-110278 (2019)
The maximum $k$ -plex problem is intended to relax the clique definition with maximum cardinality. It helps people understand the structures of networks by considering them a problem of graph clustering; therefore, it is a useful model for social net
Externí odkaz:
https://doaj.org/article/841f9ea1535a4b8ba483cb2d4598adea
Publikováno v:
IEEE Access, Vol 9, Pp 16679-16691 (2021)
IEEE Access
IEEE Access, IEEE, 2021, 9, pp.16679-16691. ⟨10.1109/ACCESS.2021.3049290⟩
IEEE Access
IEEE Access, IEEE, 2021, 9, pp.16679-16691. ⟨10.1109/ACCESS.2021.3049290⟩
A set of the spanning trees in a graph $G$ is called independent spanning trees if they have a common root $r$ and for each vertex $v\in V(G)\setminus \{r\}$ , the paths from $v$ to $r$ in any two trees are directed edge-disjoint and internally verte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae07f903e84433ec15794050c3f8bd8b
https://ieeexplore.ieee.org/document/9314008/
https://ieeexplore.ieee.org/document/9314008/
Publikováno v:
IEEE Access
IEEE Access, IEEE, 2020, 8, pp.112333-112347. ⟨10.1109/access.2020.2999421⟩
IEEE Access, Vol 8, Pp 112333-112347 (2020)
IEEE Access, IEEE, 2020, 8, pp.112333-112347. ⟨10.1109/access.2020.2999421⟩
IEEE Access, Vol 8, Pp 112333-112347 (2020)
International audience; A set of spanning trees in a graph G is called independent spanning trees (ISTs) if they are rooted at the same vertex r, and for each vertex v(= r) in G, the two paths from v to r in any two trees share no common vertex expec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6225cba1ca9b03368631f1058e7fc883
https://doi.org/10.1109/access.2020.2999421
https://doi.org/10.1109/access.2020.2999421
Publikováno v:
Journal of Combinatorial Optimization. 38:972-986
A set of spanning trees in a graph G is called independent spanning trees (ISTs for short) if they are rooted at the same vertex, say r, and for each vertex $$v(\ne r)$$ in G, the two paths from v to r in any two trees share no common edge and no com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::123b786031e8b8aca4ec23a5aa1568c8
https://doi.org/10.1007/s10878-019-00430-0
https://doi.org/10.1007/s10878-019-00430-0
Publikováno v:
IEEE Access, Vol 7, Pp 110267-110278 (2019)
The maximum $k$ -plex problem is intended to relax the clique definition with maximum cardinality. It helps people understand the structures of networks by considering them a problem of graph clustering; therefore, it is a useful model for social net
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fa213a6ec989e61fff5551e28385ce8
https://ieeexplore.ieee.org/document/8794502/
https://ieeexplore.ieee.org/document/8794502/
Publikováno v:
ICS
2020 International Computer Symposium (ICS)
2020 International Computer Symposium (ICS), Dec 2020, Tainan, Taiwan. pp.126-130, ⟨10.1109/ICS51289.2020.00034⟩
2020 International Computer Symposium (ICS)
2020 International Computer Symposium (ICS), Dec 2020, Tainan, Taiwan. pp.126-130, ⟨10.1109/ICS51289.2020.00034⟩
A complete weighted graph G = (V, E, w) is called Δ β -metric, for some β ≥ 1/2, if G satisfies the β-triangle inequality, i.e., w(u, v) ≤ β • (w(u, x) + w(x, v)) for all vertices u, v, x ∈ V . Given a Δ β -metric graph G = (V, E, w),
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a02a8acef26a91ed9d50c7022bc783b
https://doi.org/10.1109/ics51289.2020.00034
https://doi.org/10.1109/ics51289.2020.00034
Publikováno v:
Proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020)
Proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.28-40, ⟨10.1007/978-3-030-39219-2_3⟩
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2021
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
Discrete Applied Mathematics, 2022, 319, pp.425-438
Proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.28-40, ⟨10.1007/978-3-030-39219-2_3⟩
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2021
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
Discrete Applied Mathematics, 2022, 319, pp.425-438
We introduce a new graph-theoretic concept in the area of network monitoring. A set $M$ of vertices of a graph $G$ is a \emph{distance-edge-monitoring set} if for every edge $e$ of $G$, there is a vertex $x$ of $M$ and a vertex $y$ of $G$ such that $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3c048598966da4e99aba9cdafc3760e
https://hal.archives-ouvertes.fr/hal-02500423/file/paper_38.pdf
https://hal.archives-ouvertes.fr/hal-02500423/file/paper_38.pdf
