MaxDDBS
id:
maxddbs-192-18822359
title:
MaxDDBS
text:
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 the degree d, and an upper bound for the diameter k, we look for the largest subgraph S of G with maximum degree at most d and diameter at most k. This problem is also referred to as the Degree-Diameter Subgraph Problem, as it contains the degree diameter problem as a special case. Despite being a natural generalization of the Degree-Diameter Problem
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/MaxDDBS
date created:
date modified:
2024-04-22T00:21:38Z
main entity:
{"identifier":"Q6794498","url":"https://www.wikidata.org/entity/Q6794498"}
image:
fields total:
13
integrity:
13