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.
114 related articles for article (PubMed ID: 34566113)
41. Splitting Vertices in 2-Layer Graph Drawings. Ahmed R; Angelini P; Bekos MA; Battista GD; Kaufmann M; Kindermann P; Kobourov S; Nollenburg M; Symvonis A; Villedieu A; Wallinger M IEEE Comput Graph Appl; 2023; 43(3):24-35. PubMed ID: 37023163 [TBL] [Abstract][Full Text] [Related]
42. Bounds for the general sum-connectivity index of composite graphs. Akhter S; Imran M; Raza Z J Inequal Appl; 2017; 2017(1):76. PubMed ID: 28469353 [TBL] [Abstract][Full Text] [Related]
43. Cyclic connectivity index of fuzzy incidence graphs with applications in the highway system of different cities to minimize road accidents and in a network of different computers. Nazeer I; Rashid T; Hussain MT PLoS One; 2021; 16(9):e0257642. PubMed ID: 34547043 [TBL] [Abstract][Full Text] [Related]
45. Structural information content of networks: graph entropy based on local vertex functionals. Dehmer M; Emmert-Streib F Comput Biol Chem; 2008 Apr; 32(2):131-8. PubMed ID: 18243802 [TBL] [Abstract][Full Text] [Related]
46. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly. Dinh H; Rajasekaran S Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593 [TBL] [Abstract][Full Text] [Related]
47. Faster heuristics for graph burning. Gautam RK; Kare AS; S DB Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602 [TBL] [Abstract][Full Text] [Related]
48. 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]
49. Observations on the Lovász Sason I Entropy (Basel); 2023 Jan; 25(1):. PubMed ID: 36673244 [TBL] [Abstract][Full Text] [Related]
50. Vertex-connectivity in periodic graphs and underlying nets of crystal structures. Eon JG Acta Crystallogr A Found Adv; 2016 May; 72(Pt 3):376-84. PubMed ID: 27126114 [TBL] [Abstract][Full Text] [Related]
51. Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem With Extension to Hypergraph and Multiple-Graph Matching. Wang R; Yan J; Yang X IEEE Trans Pattern Anal Mach Intell; 2022 Sep; 44(9):5261-5279. PubMed ID: 33961550 [TBL] [Abstract][Full Text] [Related]
52. A Simple Algorithm for Finding All k-Edge-Connected Components. Wang T; Zhang Y; Chin FY; Ting HF; Tsin YH; Poon SH PLoS One; 2015; 10(9):e0136264. PubMed ID: 26368134 [TBL] [Abstract][Full Text] [Related]
53. Transitive closure and metric inequality of weighted graphs: detecting protein interaction modules using cliques. Ding C; He X; Xiong H; Peng H; Holbrook SR Int J Data Min Bioinform; 2006; 1(2):162-77. PubMed ID: 18399069 [TBL] [Abstract][Full Text] [Related]
54. On the characterization of claw-free graphs with given total restrained domination number. Pi X Springerplus; 2016; 5(1):1753. PubMed ID: 27795896 [TBL] [Abstract][Full Text] [Related]