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.
122 related articles for article (PubMed ID: 35880199)
21. Simple graph models of information spread in finite populations. Voorhees B; Ryder B R Soc Open Sci; 2015 May; 2(5):150028. PubMed ID: 26064661 [TBL] [Abstract][Full Text] [Related]
22. Isometric Hamming embeddings of weighted graphs. Berleant J; Sheridan K; Condon A; Williams VV; Bathe M Discrete Appl Math; 2023 Jun; 332():119-128. PubMed ID: 37982050 [TBL] [Abstract][Full Text] [Related]
23. Connectivity indices of Akram M; Siddique S; Alcantud JCR Artif Intell Rev; 2022 Dec; ():1-44. PubMed ID: 36567882 [TBL] [Abstract][Full Text] [Related]
24. Relative timing information and orthology in evolutionary scenarios. Schaller D; Hartmann T; Lafond M; Stadler PF; Wieseke N; Hellmuth M Algorithms Mol Biol; 2023 Nov; 18(1):16. PubMed ID: 37940998 [TBL] [Abstract][Full Text] [Related]
25. 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]
26. TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs. Zhang Y; Wang S; Liu C; Zhu E Sensors (Basel); 2023 Sep; 23(18):. PubMed ID: 37765887 [TBL] [Abstract][Full Text] [Related]
27. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. Nagoor Gani A; Latha SR Springerplus; 2016; 5(1):1854. PubMed ID: 27818892 [TBL] [Abstract][Full Text] [Related]
28. Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs. Fan Y; Zhang Z; Yu Q; Lai Y; Su K; Wang Y; Pan S; Latecki LJ Entropy (Basel); 2023 Sep; 25(10):. PubMed ID: 37895498 [TBL] [Abstract][Full Text] [Related]
29. Relations between ordinary energy and energy of a self-loop graph. Rakshith BR; Das KC; Manjunatha BJ; Shang Y Heliyon; 2024 Mar; 10(6):e27756. PubMed ID: 38509879 [TBL] [Abstract][Full Text] [Related]
30. Connectivity of Triangulation Flip Graphs in the Plane. Wagner U; Welzl E Discrete Comput Geom; 2022; 68(4):1227-1284. PubMed ID: 36466128 [TBL] [Abstract][Full Text] [Related]
31. Faster algorithms for counting subgraphs in sparse graphs. Bressan M Algorithmica; 2021; 83(8):2578-2605. PubMed ID: 34720296 [TBL] [Abstract][Full Text] [Related]
32. Random graphs with arbitrary degree distributions and their applications. Newman ME; Strogatz SH; Watts DJ Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Aug; 64(2 Pt 2):026118. PubMed ID: 11497662 [TBL] [Abstract][Full Text] [Related]
33. Dynamic Graph Stream Algorithms in Huang Z; Peng P Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194 [TBL] [Abstract][Full Text] [Related]
34. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297 [TBL] [Abstract][Full Text] [Related]
35. Entropy, Graph Homomorphisms, and Dissociation Sets. Wang Z; Tu J; Lang R Entropy (Basel); 2023 Jan; 25(1):. PubMed ID: 36673303 [TBL] [Abstract][Full Text] [Related]
36. Cyclization in bipartite random graphs. Lushnikov AA Phys Rev E; 2020 Mar; 101(3-1):032306. PubMed ID: 32289946 [TBL] [Abstract][Full Text] [Related]
37. Efficient Multi-View Clustering via Unified and Discrete Bipartite Graph Learning. Fang SG; Huang D; Cai XS; Wang CD; He C; Tang Y IEEE Trans Neural Netw Learn Syst; 2024 Aug; 35(8):11436-11447. PubMed ID: 37030820 [TBL] [Abstract][Full Text] [Related]
38. Local Multiset Dimension of Amalgamation Graphs. Alfarisi R; Susilowati L; Dafik D; Prabhu S F1000Res; 2023; 12():95. PubMed ID: 38835804 [No Abstract] [Full Text] [Related]
39. A parallel improvement algorithm for the bipartite subgraph problem. Lee KC; Funabiki N; Takefuji Y IEEE Trans Neural Netw; 1992; 3(1):139-45. PubMed ID: 18276415 [TBL] [Abstract][Full Text] [Related]
40. Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO Day MC; Hawthorne FC Acta Crystallogr A Found Adv; 2022 May; 78(Pt 3):212-233. PubMed ID: 35502713 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]