Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Liang-Hao Huang"'
Autor:
C. P. Kankeu Fotsing, Chih-Ya Shen, Liang-Hao Huang, Yi-Shin Chen, Wang-Chien Lee, De-Nian Yang
Publikováno v:
IEEE Transactions on Services Computing. :1-14
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9352ae6e8fbb1ef0fef6b14d211a485e
https://doi.org/10.1109/tsc.2023.3248321
https://doi.org/10.1109/tsc.2023.3248321
Autor:
Hong-Han Shuai, Guang-Siang Lee, Ming-Syan Chen, Liang-Hao Huang, De-Nian Yang, Wang-Chien Lee, Chih-Ya Shen
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. :1-1
Existing research on finding social groups mostly focuses on dense subgraphs in social networks. However, finding socially tenuous groups also has many important applications. In this paper, we introduce the notion of k-triangles to measure the tenui
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce2122e2a2afe5d1338d5fa1185b9af0
https://doi.org/10.1109/tkde.2020.3025911
https://doi.org/10.1109/tkde.2020.3025911
Publikováno v:
KDD
Existing research on finding social groups mostly focuses on dense subgraphs in social networks. However, finding socially tenuous groups also has many important applications. In this paper, we introduce the notion of k-triangles to measure the tenui
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c66deb1fecd20ff5fa5bd03c9cab3188
https://doi.org/10.1145/3097983.3097995
https://doi.org/10.1145/3097983.3097995
Publikováno v:
Linear Algebra and its Applications. 449:119-131
This paper investigates linear guessing number introduced by Riis in connection with the network coding theory. This paper establishes properties of linear guessing number on undirected graphs. In particular, lower and upper bounds for linear guessin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27d786e9249d684925142c8e7b89d971
https://doi.org/10.1016/j.laa.2014.02.010
https://doi.org/10.1016/j.laa.2014.02.010
Publikováno v:
Linear Algebra and its Applications. 438:4008-4040
For a simple graph G, let rank(G) and dnzr(G) denote respectively the rank and the number of distinct nonzero rows of the adjacency matrix A(G) of G. Equivalent conditions are given for the join G 1 ∨ G 2 of two vertex-disjoint graphs G 1 , G 2 to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de95c85a65f00faad6a0f53fdd21847e
https://doi.org/10.1016/j.laa.2012.06.027
https://doi.org/10.1016/j.laa.2012.06.027
Publikováno v:
SIAM Journal on Discrete Mathematics. 27:310-328
Let $G$ be a graph with a threshold function $\theta:V(G)\rightarrow \mathbb{N}$ such that $1\leq \theta(v)\leq d_G(v)$ for every vertex $v$ of $G$, where $d_G(v)$ is the degree of $v$ in $G$. Suppose we are given a target set $S\subseteq V(G)$. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6a965ee0a728a945d99143875fb88d5
https://doi.org/10.1137/120868864
https://doi.org/10.1137/120868864
Autor:
Ming-Syan Chen, Hong-Han Shuai, De-Nian Yang, Liang-Hao Huang, Hui-Ju Hung, Jian Pei, Wang-Chien Lee
Publikováno v:
KDD
Research issues and data mining techniques for product recommendation and viral marketing have been widely studied. Existing works on seed selection in social networks do not take into account the effect of product recommendations in e-commerce store
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd81cb111869ce6393246ea6a389528c
https://doi.org/10.1145/2939672.2939758
https://doi.org/10.1145/2939672.2939758
Publikováno v:
INFOCOM
Although Software-Defined Networking (SDN) enables flexible network resource allocations for traffic engineering, current literature mostly focuses on unicast communications. Compared to traffic engineering for multiple unicast flows, multicast traff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::698668f0075f75149eea334e1061fadc
https://doi.org/10.1109/infocom.2016.7524383
https://doi.org/10.1109/infocom.2016.7524383
Publikováno v:
Linear Algebra and its Applications. 434(8):1793-1798
The rank of a graph G is defined to be the rank of its adjacency matrix. In this paper, we consider the following problem: What is the structure of a connected graph with rank 4? This question has not yet been fully answered in the literature, and on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a5a2b4f4c5068701aaf20c778df34c7
Publikováno v:
Journal of Combinatorial Optimization. 24:266-279
A variation of the classical channel assignment problem is to assign a radio channel which is a nonnegative integer to each radio transmitter so that "close" transmitters must receive different channels and "very close" transmitters must receive chan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab45d74e3713423e630eaca0a8dd4a74
https://doi.org/10.1007/s10878-011-9380-8
https://doi.org/10.1007/s10878-011-9380-8