These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
130 related articles for article (PubMed ID: 34310677)
1. Direction Matters: On Influence-Preserving Graph Summarization and Max-Cut Principle for Directed Graphs. Xu W; Niu G; Hyvärinen A; Sugiyama M Neural Comput; 2021 Jul; 33(8):2128-2162. PubMed ID: 34310677 [TBL] [Abstract][Full Text] [Related]
2. Transduction on Directed Graphs via Absorbing Random Walks. De J; Zhang X; Lin F; Cheng L; De J; Xiaowei Zhang ; Feng Lin ; Li Cheng ; De J; Cheng L; Zhang X; Lin F IEEE Trans Pattern Anal Mach Intell; 2018 Jul; 40(7):1770-1784. PubMed ID: 28809671 [TBL] [Abstract][Full Text] [Related]
3. Representing Graphs via Gromov-Wasserstein Factorization. Xu H; Liu J; Luo D; Carin L IEEE Trans Pattern Anal Mach Intell; 2023 Jan; 45(1):999-1016. PubMed ID: 35196227 [TBL] [Abstract][Full Text] [Related]
4. A spectral graph convolution for signed directed graphs via magnetic Laplacian. Ko T; Choi Y; Kim CK Neural Netw; 2023 Jul; 164():562-574. PubMed ID: 37216757 [TBL] [Abstract][Full Text] [Related]
5. Contextual Correlation Preserving Multiview Featured Graph Clustering. He T; Liu Y; Ko TH; Chan KCC; Ong YS IEEE Trans Cybern; 2020 Oct; 50(10):4318-4331. PubMed ID: 31329151 [TBL] [Abstract][Full Text] [Related]
6. Minimizing the Number of Edges via Edge Concentration in Dense Layered Graphs. Onoue Y; Kukimoto N; Sakamoto N; Koyamada K IEEE Trans Vis Comput Graph; 2016 Jun; 22(6):1652-1661. PubMed ID: 26955033 [TBL] [Abstract][Full Text] [Related]
7. Relational Reasoning Over Spatial-Temporal Graphs for Video Summarization. Zhu W; Han Y; Lu J; Zhou J IEEE Trans Image Process; 2022; 31():3017-3031. PubMed ID: 35385384 [TBL] [Abstract][Full Text] [Related]
8. DHPV: a distributed algorithm for large-scale graph partitioning. Adoni WYH; Nahhal T; Krichen M; El Byed A; Assayad I J Big Data; 2020; 7(1):76. PubMed ID: 32953386 [TBL] [Abstract][Full Text] [Related]
9. Visual exploration of complex time-varying graphs. Kumar G; Garland M IEEE Trans Vis Comput Graph; 2006; 12(5):805-12. PubMed ID: 17080803 [TBL] [Abstract][Full Text] [Related]
10. Co-clustering directed graphs to discover asymmetries and directional communities. Rohe K; Qin T; Yu B Proc Natl Acad Sci U S A; 2016 Nov; 113(45):12679-12684. PubMed ID: 27791058 [TBL] [Abstract][Full Text] [Related]
11. Graph-preserving sparse nonnegative matrix factorization with application to facial expression recognition. Zhi R; Flierl M; Ruan Q; Kleijn WB IEEE Trans Syst Man Cybern B Cybern; 2011 Feb; 41(1):38-52. PubMed ID: 20403788 [TBL] [Abstract][Full Text] [Related]
12. Constrained likelihood for reconstructing a directed acyclic Gaussian graph. Yuan Y; Shen X; Pan W; Wang Z Biometrika; 2019 Mar; 106(1):109-125. PubMed ID: 30799877 [TBL] [Abstract][Full Text] [Related]
13. Compressed graph representation for scalable molecular graph generation. Kwon Y; Lee D; Choi YS; Shin K; Kang S J Cheminform; 2020 Sep; 12(1):58. PubMed ID: 33431050 [TBL] [Abstract][Full Text] [Related]
15. FlexGraph: Flexible partitioning and storage for scalable graph mining. Park C; Park HM; Kang U PLoS One; 2020; 15(1):e0227032. PubMed ID: 31978075 [TBL] [Abstract][Full Text] [Related]
16. Seeing the results of a mutation with a vertex weighted hierarchical graph. Knisley DJ; Knisley JR BMC Proc; 2014; 8(Suppl 2 Proceedings of the 3rd Annual Symposium on Biologica):S7. PubMed ID: 25237394 [TBL] [Abstract][Full Text] [Related]
17. On the centrality of vertices of molecular graphs. Randić M; Novič M; Vračko M; Plavšić D J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387 [TBL] [Abstract][Full Text] [Related]
18. Intrinsic graph structure estimation using graph Laplacian. Noda A; Hino H; Tatsuno M; Akaho S; Murata N Neural Comput; 2014 Jul; 26(7):1455-83. PubMed ID: 24708372 [TBL] [Abstract][Full Text] [Related]