Sampath Kannan, et al.  Home/Search
Context
Related
| arizona.edu/reports/1992...TR9208.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: arizona.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We define and study the graph-theoretic notion of an anchor in a tournament. An anchor in a tournament is a subset of the nodes of the tournament such that every pair of nodes outside the anchor is `distinguished' at one of the nodes in the anchor. We show that every n-node tournament has an anchor of size at most 2n=3 and that there are n-node tournaments where the anchor size is at least n=2. We also show that finding a minimum-sized anchor in a tournament is NP-Complete. Finally we point out ... (Update)
Active bibliography (related documents): More All
0.1: An Optimal Lower Bound on the Number of Variables for.. - Cai, Fürer, Immerman (1992) (Correct)
0.1: Describing Graphs: a First-Order Approach to Graph Canonization - Immerman, Lander (1990) (Correct)
0.1: Computing in Quotient Groups - Kantor, Luks (1990) (Correct)
Similar documents based on text: More All
0.6: A Decision Problem Involving Tournaments - Cherlin (1996) (Correct)
0.6: Short Score Certificates for Upset Tournaments - Poet, Shader (1998) (Correct)
0.6: Embedded Antichains in Tournaments - Greenfield, Latka (Correct)
BibTeX entry: (Update)
@misc{ kannan-anchors,
author = "Sampath Kannan and et al.",
title = "Anchors in Tournaments",
url = "citeseer.ist.psu.edu/kannan92anchors.html" }
Citations (may not include all citations):49 Isomorphism of Graphs of Bounded Valence can be Tested in Po.. (context) - Luks - 1982
16 Moderately Exponential Bound for Graph Isomorphism (context) - Babai - 1981
14 Computational Complexity and the Classification of Finite Si.. (context) - Babai, Kantor et al. - 1983
1 Isomorphism Testing and Symmetry of Graphs (context) - Babai - 1980
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.arizona.edu.html): More
x-Kernel Programmer's Manual (Version 3.2) - Menze, III, Orman (1996) (Correct)
Implementing a Secure rlogin Environment: A Case Study of.. - Kim, Orman, O'Malley (1995) (Correct)
A Software Platform for Constructing Scientific.. - Homer, Schlichting (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC