Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference86 articles.
1. Rectilinear Steiner trees: efficient special case algorithms;Aho;Networks,1977
2. Complexity of finding k-path-free dominating sets in graphs;Bar-Yehuda;Inform. Process. Lett.,1982
3. Planar L1 tree layout;Becker,1980
4. Generalized planar matching;Berman,1983
5. The edge Hamiltonian path problem is NP-complete;Bertossi;Inform. Process. Lett.,1981
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithmic Aspects of Domination in Graphs;Handbook of Combinatorial Optimization;2013
2. Graph Kernels;Statistical and Machine Learning Approaches for Network Analysis;2012-06-21
3. The Evolution of an Idea — Gallai’s Algorithm;Bolyai Society Mathematical Studies;2006
4. Algorithmic Engines in Virtual Screening;Methods and Principles in Medicinal Chemistry;2005-01-26
5. A Characterization of Domination Reducible Graphs;Graphs and Combinatorics;2004-06-01