Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,566,345 papers from all fields of science
Search
Sign In
Create Free Account
MaxDDBS
The Maximum Degree-and-Diameter-Bounded Subgraph problem (MaxDDBS) is a problem in graph theory. Given a connected host graph G, an upper bound for…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Degree diameter problem
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
MaxDDBS problem on butterfly networks
N. Bong
,
Mirka Miller
,
J. Ryan
,
K. Sugeng
The Australasian Journal of Combinatorics
2017
Corpus ID: 235813
A maximum degree-diameter bounded subgraph problem can be seen as a degree-diameter problem restricted to certain host graphs. In…
Expand
2012
2012
Sharper Lower Bounds in the Maximum Degree and Diameter Bounded Subgraph Problem in the Mesh
Sachi Hashimoto
2012
Corpus ID: 119689861
The Maximum Degree and Diameter Bounded Subgraph Problem (MaxDDBS) asks: given a host graph G, a bound on maximum degree \Delta…
Expand