Clique partitions, graph compression and speeding-up algorithms

Tomás Feder, Rajeev Motwani · 1991

Article Clique partitions, graph compression and speeding-up algorithms Share on Authors: Tomás Feder Bellcore, Morristown, NJ Bellcore, Morristown, NJView Profile , Rajeev Motwani Stanford Univ., Stanford, CA Stanford Univ., Stanford, CAView Profile Authors Info & Claims STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of ComputingJanuary 1991 Pages 123–133https://doi.org/10.1145/103418.103424Online:03 January 1991Publication History 52citation1,288DownloadsMetricsTotal Citations52Total Downloads1,288Last 12 Months15Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Read the paper · More papers on PaperTik