99 search results - page 4 / 20 » On a class of finite symmetric graphs |
104
Voted
DISOPT
2006
15 years 17 days ago
2006
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
102
Voted
TIT
1998
15 years 5 days ago
1998
—This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborho...
132
click to vote
SIAMDM
2010
14 years 7 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
97
Voted
COMBINATORICS
2006
15 years 17 days ago
2006
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
81
Voted
ECCC
2010
15 years 18 days ago
2010
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...