- Dissociation number
-
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 [1][2], where it was proved to be NP-hard in the class of bipartite and planar graphs.
Notes
References
- Yannakakis, Mihalis (1981). "Node-Deletion Problems on Bipartite Graphs". SIAM J. Comput. (2): 310–327. doi:10.1137/0210022.
- Papadimitriou, Christos H.; Yannakakis, Mihalis (1982). "The complexity of restricted spanning tree problems". J. ACM 29 (2): 285–309. doi:10.1145/322307.322309.
External links
Categories:
Wikimedia Foundation. 2010.