Premium
A note on trees, tables, and algorithms
Author(s) -
Goddard Wayne,
Hedetniemi Stephen T.
Publication year - 2009
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20282
Subject(s) - table (database) , computer science , simple (philosophy) , vertex (graph theory) , algorithm , property (philosophy) , set (abstract data type) , tree (set theory) , mathematics , theoretical computer science , combinatorics , graph , data mining , programming language , philosophy , epistemology
Several algorithms for optimal vertex subsets in trees are given by simple tables. In this article we investigate the properties of and operations on these tables. We use known techniques for combining tables to correct a table in the literature; give a necessary and sufficient condition for a table to correspond to some tree property; discuss the question of dividing one table by another; explain how to derive a table from a set of representatives; and apply this to finding the table for the parameter external redundance. All of this is facilitated by computer software. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009