Elusiveness of finding degrees

DOI10.1016/J.DAM.2019.06.009zbMATH Open1448.05039OpenAlexW2959532596WikidataQ127483449 ScholiaQ127483449MaRDI QIDQ2201777FDOQ2201777

Authors: Dishant Goyal, Varunkumar Jayapaul, Venkatesh Raman 

Publication date: 17 September 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.06.009

Recommendations

• Elusiveness of finding degrees
• Tight bounds for finding degrees from the adjacency matrix
• The complexity of finding certain trees in tournaments
• Finding Scores in Tournaments
• Finding cliques using few probes

zbMATH Keywords

maximum degree\(k\)-degreeelusiveadversary arguments

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• On recognizing graph properties from adjacency matrices
• A lower bound for the recognition of digraph properties
• Evasiveness of graph properties and topological fixed-point theorems
• Finding Scores in Tournaments
• Complete subgraphs are elusive
• Perfectness is an Elusive Graph Property
• Elusiveness of finding degrees

Cited In (3)

• Tight bounds for finding degrees from the adjacency matrix
• Query complexity of tournament solutions
• Elusiveness of finding degrees

This page was built for publication: Elusiveness of finding degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201777)