A dichotomy theorem on fixed points of several nonexpansive mappings

SIAM Journal on Discrete Mathematics

Volumn 20, Issue 2, 2006, Pages 291-301

  Feder, Tomás ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Apiculate graphs; Fixed points; Nonexpansive mappings; Product graphs; Retractions

Indexed keywords

APICULATE GRAPHS; FIXED POINTS; NONEXPANSIVE MAPPINGS; PRODUCT GRAPHS; RETRACTIONS;

ALGORITHMS; CONFORMAL MAPPING; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

THEOREM PROVING;

EID: 34249102217     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103427734     Document Type: Article

References (10)

1. H.-J. BANDELT AND V. CHEPOI, The Algebra of Metric Betweenness: Subdirect Representations, Retracts, and Axiomatics of Weakly Median Graphs, manuscript.
2. A. A. BULATOV, A dichotomy constraint on a three-element set, in Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, Montreal, 2002, pp. 649-658.
3. A. A. BULATOV, Tractable conservative constraint satisfaction problems, in Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, Ottawa, 2003, pp. 321-330.
4. T. FEDER, Stable Networks and Product Graphs, Doctoral dissertation, Stanford University, Palo Alto, CA, 1990. Mem. Amer. Math. Soc. 116 (1995), pp. 1-223.
5. T. FEDER AND M. Y. VARDI, The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory, SIAM J. Comput., 28 (1999), pp. 57-104.
6. E. MAYR AND A. SUBRAMANIAN, The complexity of circuit value and network stability, in Fourth Annual Conference on Structure in Complexity Theory, Eugene, OR, (1989), pp. 114-123.
7. Full version in J. Comput. System Sci., 44 (1992), pp. 302-323.
8. T. J. SCHAEPER, The complexity of satisfiability problems, in Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, San Diego, ACM, New York, 1978, pp. 216-226.
9. A. SUBRAMANIAN, A new approach to stable matching problems, SIAM J. Comput., 23 (1994), pp. 671-701.
10. A. SUBRAMANIAN, The Complexity of Circuit Value and Network Stability, Doctoral dissertation, Stanford University, Palo Alto, CA, 1989.