Efficient and Practical Algorithms for Sequential Modular Decomposition Export

@article{citeulike:733241, abstract = {A module of an undirected graph G = (V, E) is a set X of vertices that have the same set of neighbors in V\X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a practical algorithm with an O(n + m[alpha](m, n)) time bound and a variant with a linear time bound.}, author = {Dahlhaus, Elias and Gustedt, Jens and Mcconnell, Ross M.}, citeulike-article-id = {733241}, citeulike-linkout-0 = {http://dx.doi.org/10.1006/jagm.2001.1185}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0196-6774(01)91185-X}, citeulike-linkout-2 = {http://www.sciencedirect.com/science/article/B6WH3-45S4RWJ-C/2/d149cc8cb5ad6a0b2e471f25141ef865}, doi = {10.1006/jagm.2001.1185}, journal = {Journal of Algorithms}, keywords = {algorithm, graph}, month = {November}, number = {2}, pages = {360--387}, posted-at = {2008-11-30 07:19:15}, priority = {2}, title = {Efficient and Practical Algorithms for Sequential Modular Decomposition}, url = {http://dx.doi.org/10.1006/jagm.2001.1185}, volume = {41}, year = {2001} }

TY - JOUR ID - citeulike:733241 L3 - citeulike-article-id:733241 N2 - A module of an undirected graph G = (V, E) is a set X of vertices that have the same set of neighbors in V\X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a practical algorithm with an O(n + m[alpha](m, n)) time bound and a variant with a linear time bound. IS - 2 JF - Journal of Algorithms EP - 387 TI - Efficient and Practical Algorithms for Sequential Modular Decomposition VL - 41 SP - 360 KW - algorithm KW - graph AU - Dahlhaus, Elias AU - Gustedt, Jens AU - Mcconnell, Ross PY - 2001/11// UR - http://dx.doi.org/10.1006/jagm.2001.1185 ER -