Axioms for clustering simple unweighted graphs: No impossibility result

Open Access

Peer-reviewed

Research Article

About the Authors

James Willson

Roles Conceptualization, Formal analysis, Writing – original draft, Writing – review & editing

Affiliation Siebel School of Computing and Data Science, University of Illinois Urbana-Champaign, Urbana, Illinois, United States of America

Tandy Warnow

Roles Conceptualization, Formal analysis, Supervision, Writing – original draft, Writing – review & editing

Affiliation Siebel School of Computing and Data Science, University of Illinois Urbana-Champaign, Urbana, Illinois, United States of America

The authors have declared that no competing interests exist.

Graphs
Is the Subject Area "Graphs" applicable to this article?

Thanks for your feedback.
Clustering algorithms
Is the Subject Area "Clustering algorithms" applicable to this article?

Thanks for your feedback.
Computer software
Is the Subject Area "Computer software" applicable to this article?

Thanks for your feedback.
Optimization
Is the Subject Area "Optimization" applicable to this article?

Thanks for your feedback.
Arithmetic
Is the Subject Area "Arithmetic" applicable to this article?

Thanks for your feedback.
Directed graphs
Is the Subject Area "Directed graphs" applicable to this article?

Thanks for your feedback.
Permutation
Is the Subject Area "Permutation" applicable to this article?

Thanks for your feedback.
Scientists
Is the Subject Area "Scientists" applicable to this article?

Thanks for your feedback.