Abstract
We address the complexity of finding a vertex with specific (or maximum) (out)degree in undirected graphs, directed graphs and in tournaments in a model where we count only the probes to the adjacency matrix of the graph. Improving upon some earlier bounds, using adversary arguments, we show that the following problems require \({n \atopwithdelims ()2}\) probes to the adjacency matrix of an n node graph:
-
determining whether a given directed graph has a vertex of outdegree k (for a non-negative integer \(k \le (n+1)/2\));
-
determining whether an undirected graph has a degree 0 or 1 vertex;
-
finding the maximum (out)degree in a directed or an undirected graph, and
-
finding all vertices with the maximum outdegree in a tournament.
A property of a simple graph is elusive, if any algorithm to determine the property requires all the relevant probes to the adjacency matrix of the graph in the worst case. So the above results imply that determining whether a directed graph has a vertex of (out)degree k (for a non-negative integer \(k \le (n+1)/2\)) or an undirected graph has a vertex of degree 0 or 1 vertex are elusive properties.
In contrast, we show that one can find a maximum outdegree in a tournament using at most \({n \atopwithdelims ()2} -1\) probes. By substantially improving a known lower bound, we show that, for this problem \({n \atopwithdelims ()2} -2\) probes are necessary if n is odd, and \({n \atopwithdelims ()2} -n/2 -2\) probes are necessary if n is even. For determining the existence of a vertex with degree \(k > 1\) in an undirected graph, we give a lower bound of \(.42n^2\) improving on the earlier lower bound of \(.25n^2\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Balasubramanian, R., Raman, V., Srinivasaragavan, G.: Finding scores in tournaments. J. Algorithms 24(2), 380–394 (1997)
Bollabas, B.: Complete subgraphs are elusive. J. Comb. Theor. B 21, 1–7 (1976)
Hougardy, S., Wagler, A.: Perfectness is an elusive graph property. SIAM J. Comput. 34(1), 109–117 (2004)
King, V.: A lower bound for the recognition of digraph properties. Combinatorica 10(1), 53–59 (1990)
Miller, C.A.: Evasiveness of graph properties and topological fixed-point theorems. Found. Trends Theoret. Comput. Sci. 7(4), 337–415 (2011)
Moon, J.W.: Topics on Tournaments. Reinhart and Winston, Holt (1968)
Rivest, R.L., Vuillemin, J.: On recognizing graph properties from adjacency matrices. Theoret. Comput. Sci. 3(3), 371–384 (1976)
Rosenberg, A.L.: On the time required to recognize properties of graphs: a problem. SIGACT News 5(4), 15–16 (1973)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Goyal, D., Jayapaul, V., Raman, V. (2017). Elusiveness of Finding Degrees. In: Gaur, D., Narayanaswamy, N. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2017. Lecture Notes in Computer Science(), vol 10156. Springer, Cham. https://doi.org/10.1007/978-3-319-53007-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-53007-9_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53006-2
Online ISBN: 978-3-319-53007-9
eBook Packages: Computer ScienceComputer Science (R0)