Search results

Create the page "The maximum degree-and-diameter-bounded subgraph problem" on this wiki! See also the search results found.

Page title matches

• The Maximum Degree-and-Diameter-Bounded Subgraph Problem
  ...mation algorithm was proposed. Regarding its computational complexity, the problem is NP-hard, and not in APX (i.e. it cannot be approximated to within a cons [[MaxDDBS in the mesh]]
  1 KB (181 words) - 14:39, 3 January 2019

Page text matches

• List of Moderators
  ...ch with the chief moderator. If you would like to contribute to a specific problem area, please get in touch with one of that area's moderators. ==The cage problem==
  1 KB (154 words) - 14:39, 3 January 2019
• MaxDDBS in the mesh
  == The mesh as host graph == ...argest subgraph of the mesh in arbitrary dimension. Moreover, it discusses the cases of degree 4 in dimension 3, and degree 3 in dimension 2, where some g
  7 KB (748 words) - 11:31, 31 January 2019
• The Maximum Degree-and-Diameter-Bounded Subgraph Problem
  ...mation algorithm was proposed. Regarding its computational complexity, the problem is NP-hard, and not in APX (i.e. it cannot be approximated to within a cons [[MaxDDBS in the mesh]]
  1 KB (181 words) - 14:39, 3 January 2019
• Main Page
  ...will only allow updates by active expert researchers in their fields, with the following goals: ...t can be very helpful to announce and briefly describe new findings before the actual publication.
  4 KB (588 words) - 07:57, 16 July 2023
• Publications
  == ARTICLES INDEXED IN THE WEB OF SCIENCE CORE COLLECTION (CLARIVATE ANALYTICS) == 1. “The Inverse Voronoi Problem in Graphs I: Hardness” (jointly with Edouard Bonnet,Sergio Cabello and Bo
  12 KB (1,602 words) - 15:04, 6 June 2020
• Mirka Miller's Combinatorics Webinar Series
  Welcome to the home page for Mirka Miller's Combinatorics Webinar Series. ''' Title: On the Moore cages with a prescribed girth pair '''
  46 KB (7,457 words) - 10:28, 21 April 2024