{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:12:27Z","timestamp":1747807947028},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631385"},{"type":"electronic","value":"9783540691570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63138-0_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:07:45Z","timestamp":1330297665000},"page":"37-48","source":"Crossref","is-referenced-by-count":6,"title":["On computing all maximal cliques distributedly"],"prefix":"10.1007","author":[{"given":"F\u00e1bio","family":"Protti","sequence":"first","affiliation":[]},{"given":"Felipe M. G.","family":"Fran\u00e7a","sequence":"additional","affiliation":[]},{"given":"Jayme Luiz","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0164-1212(94)90016-7","volume":"26","author":"V. C. Barbosa","year":"1994","unstructured":"V. C. BARBOSA, L. M. de A. DRUMMOND, and A. L. H. HELLMUT, From distributed algorithms to Occam programs by successive refinements, The J. of Systems and Software 26 (1994), pp. 257\u2013272.","journal-title":"The J. of Systems and Software"},{"key":"4_CR2","unstructured":"V. C. BARBOSA and F. M. G. FRANCA, Specification of a communication virtual processor for parallel processing systems, in Proc. of Euromicro-88 (1988), pp. 511\u2013518."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/69558.69560","volume":"11","author":"V. C. Barbosa","year":"1989","unstructured":"V. C. BARBOSA and E. GAFNI, Concurrency in heavily loaded neighborhood-constrained systems, ACM Transactions on Programming Languages and Systems 11 (1989), pp. 562\u2013584.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR4","unstructured":"V. C. BARBOSA and J. L. SZWARCFITER, Generating all acyclic orientations of an undirected graph, Technical Report ES-405\/96, COPPE\/Federal University of Rio de Janeiro."},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01840389","volume":"5","author":"I. Cidon","year":"1990","unstructured":"I. CIDON and I. S. GOPAL, Dynamic Detection of Subgraphs in Computer Networks, Algorithmica 5 (1990), pp. 277\u2013294.","journal-title":"Algorithmica"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"E. DAHLHAUS and M. KARPINSKI, A fast parallel algorithm for computing all maximal cliques in a graph and related problems, Proc. of the first Scandinavian Workshop on Algorithm Theory (1988), pp. 139\u2013144.","DOI":"10.1007\/3-540-19487-8_16"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"F. M. G. FRANCA and L. FARIA, Optimal mapping of neighborhood-constrained systems, in A. Ferreira and J. Rolim eds., Lecture Notes in Computer Science 980, pp. 165\u2013170.","DOI":"10.1007\/3-540-60321-2_14"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"E. JENNINGS and L. MOTYCKOVA, A distributed algorithm for finding all maximal cliques in a network graph, in I. Simon, ed., Lecture Notes in Computer Science 583, pp. 281\u2013293, 1992.","DOI":"10.1007\/BFb0023836"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D. S. Johnson","year":"1988","unstructured":"D. S. JOHNSON, M. YANNAKAKIS, and C. H. PAPADIMITRIOU, On generating all maximal independent sets, Information Processing Letters 27 (1988), pp. 119\u2013123","journal-title":"Information Processing Letters"},{"key":"4_CR10","first-page":"3","volume-title":"Foundations of Computer Science II Part I","author":"E. L. Lawler","year":"1976","unstructured":"E. L. LAWLER, Graphical algorithms and their complexity, Mathematical Centre Tracts 81 (1976), Foundations of Computer Science II Part I, Mathematisch Centrum, Amsterdam, pp. 3\u201332."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TEC.1959.5222697","volume":"EC-8","author":"M. C. Paul","year":"1959","unstructured":"M. C. PAUL and S. H. UNGER, Minimizing the number of states in incompletely specified sequential functions, IRE Trans. Electr. Computers EC-8 (1959), pp. 356\u2013357.","journal-title":"IRE Trans. Electr. Computers"},{"key":"4_CR12","unstructured":"E. PRISNER, Graph Dynamics, Pitman Research Notes in Mathematics Series 338 (1995), Longman."},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"S. TSUKIYAMA, M. IDE, H. ARUJOSHI and H. OZAKI, A new algorithm for generating all the maximal independent sets, SIAM J. Computing 6 (1977), pp. 505\u2013517.","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Solving Irregularly Structured Problems in Parallel"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63138-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:54Z","timestamp":1605647754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63138-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631385","9783540691570"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-63138-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}