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.
138 related articles for article (PubMed ID: 33707803)
1. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. Ganian R; Ordyniak S Algorithmica; 2021; 83(2):726-752. PubMed ID: 33707803 [TBL] [Abstract][Full Text] [Related]
2. New algorithms for maximum disjoint paths based on tree-likeness. Fleszar K; Mnich M; Spoerhase J Math Program; 2018; 171(1):433-461. PubMed ID: 30956356 [TBL] [Abstract][Full Text] [Related]
10. Approximating the double-cut-and-join distance between unsigned genomes. Chen X; Sun R; Yu J BMC Bioinformatics; 2011 Oct; 12 Suppl 9(Suppl 9):S17. PubMed ID: 22151948 [TBL] [Abstract][Full Text] [Related]
11. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing. Altarelli F; Braunstein A; Dall'Asta L; De Bacco C; Franz S PLoS One; 2015; 10(12):e0145222. PubMed ID: 26710102 [TBL] [Abstract][Full Text] [Related]
12. 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]
13. Parameterized Complexity and Inapproximability of Dominating Set Problem in Chordal and Near Chordal Graphs. Liu C; Song Y J Comb Optim; 2010 Apr; 20(2):1-15. PubMed ID: 23874144 [TBL] [Abstract][Full Text] [Related]
14. A heuristic method for solving the Steiner tree problem in graphs using network centralities. Fujita M; Shimada Y; Kimura T; Ikeguchi T PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249 [TBL] [Abstract][Full Text] [Related]
15. On the Decomposition of Vertex-Transitive Graphs into Multicycles. Leighton FT J Res Natl Bur Stand (1977); 1983; 88(6):403-410. PubMed ID: 34566113 [TBL] [Abstract][Full Text] [Related]
16. Transforming graph states using single-qubit operations. Dahlberg A; Wehner S Philos Trans A Math Phys Eng Sci; 2018 Jul; 376(2123):. PubMed ID: 29807902 [TBL] [Abstract][Full Text] [Related]
17. Non-Preemptive Tree Packing. Lendl S; Woeginger G; Wulf L Algorithmica; 2023; 85(3):783-804. PubMed ID: 36883187 [TBL] [Abstract][Full Text] [Related]
18. 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]
19. Complexity of Secure Sets. Bliem B; Woltran S Algorithmica; 2018; 80(10):2909-2940. PubMed ID: 29937611 [TBL] [Abstract][Full Text] [Related]