Author:
Goodman S.,Hedetniemi S.,Tarjan R. E.
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Reference9 articles.
1. On covering the points of a graph with point disjoint paths
2. Time bounds for selection
3. Paths, Trees, and Flowers
4. On the hamiltonian completion problem
5. Donald E. Knuth, The art of computer programming. Vol. 1: Fundamental algorithms, Second printing, Addison-Wesley Publishing Co., Reading, Mass.London-Don Mills, Ont, 1969, 334–338MR0286317 (44:3530)0191.17903
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Cores of Simplicial Complexes;Discrete & Computational Geometry;2008-05-15
2. Maintaining Regular Properties Dynamically in k-Terminal Graphs;Algorithmica;1998-11
3. An improved linear placement algorithm using node compaction;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;1996
4. The Private Neighbor Cube;SIAM Journal on Discrete Mathematics;1994-02
5. Parallel computation of matchings in trees;Parallel Computing;1991-09