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.
5. 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]
6. SING: subgraph search in non-homogeneous graphs. Di Natale R; Ferro A; Giugno R; Mongiovì M; Pulvirenti A; Shasha D BMC Bioinformatics; 2010 Feb; 11():96. PubMed ID: 20170516 [TBL] [Abstract][Full Text] [Related]
7. Improved algorithms for enumerating tree-like chemical graphs with given path frequency. Ishida Y; Zhao L; Nagamochi H; Akutsu T Genome Inform; 2008; 21():53-64. PubMed ID: 19425147 [TBL] [Abstract][Full Text] [Related]
8. 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]
9. Characterization of 2-Path Product Signed Graphs with Its Properties. Sinha D; Sharma D Comput Intell Neurosci; 2017; 2017():1235715. PubMed ID: 28761437 [TBL] [Abstract][Full Text] [Related]
10. The Complexity of Optimal Design of Temporally Connected Graphs. Akrida EC; Gąsieniec L; Mertzios GB; Spirakis PG Theory Comput Syst; 2017; 61(3):907-944. PubMed ID: 32025196 [TBL] [Abstract][Full Text] [Related]
11. Parameterized algorithmics for finding connected motifs in biological networks. Betzler N; van Bevern R; Fellows MR; Komusiewicz C; Niedermeier R IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1296-308. PubMed ID: 21282862 [TBL] [Abstract][Full Text] [Related]
12. Recognition of shapes by editing their shock graphs. Sebastian TB; Klein PN; Kimia BB IEEE Trans Pattern Anal Mach Intell; 2004 May; 26(5):550-71. PubMed ID: 15460278 [TBL] [Abstract][Full Text] [Related]
13. Querying graphs in protein-protein interactions networks using feedback vertex set. Blin G; Sikora F; Vialette S IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):628-35. PubMed ID: 20498512 [TBL] [Abstract][Full Text] [Related]
14. Tugging graphs faster: efficiently modifying path-preserving hierarchies for browsing paths. Archambault D; Munzner T; Auber D IEEE Trans Vis Comput Graph; 2011 Mar; 17(3):276-89. PubMed ID: 20421680 [TBL] [Abstract][Full Text] [Related]
15. A distributed query execution engine of big attributed graphs. Batarfi O; Elshawi R; Fayoumi A; Barnawi A; Sakr S Springerplus; 2016; 5(1):665. PubMed ID: 27350905 [TBL] [Abstract][Full Text] [Related]
16. Path matching and graph matching in biological networks. Yang Q; Sze SH J Comput Biol; 2007; 14(1):56-67. PubMed ID: 17381346 [TBL] [Abstract][Full Text] [Related]