Dissociation number
id:
dissociation-number-268-1314145
title:
Dissociation number
text:
In the mathematical discipline of graph theory, a subset of vertices in a graph G is called dissociation if it induces a subgraph with maximum degree 1. The number of vertices in a maximum cardinality dissociation set in G is called the dissociation number of G, denoted by diss(G). The problem of computing diss(G) (dissociation number problem) was firstly studied by Yannakakis. The problem is NP-hard even in the class of bipartite and planar graphs. An algorithm for computing a 4/3-approximation
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Dissociation_number
date created:
date modified:
2024-01-14T21:57:46Z
main entity:
{"identifier":"Q5282790","url":"https://www.wikidata.org/entity/Q5282790"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/8/8d/Dissociation_number.pdf","width":458,"height":447}
fields total:
13
integrity:
14