( en | de | ru )

 

Disambiguation of "Stolman, Andrew"

Author of the publication

copydeleteadd this publication to your clipboard
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling.

, , , and . SDM, page 388-396. SIAM, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrew Singer

Andrew Torda

Andrew Cato

Andrew Huvos

Andrew Lee

 

Other publications of authors with the same name

The impossibility of low rank representations for triangle-rich complex networks., , , and . CoRR, (2020)Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes., , and . Electron. Colloquium Comput. Complex., (2021)Random walks and forbidden minors III: $polyłeft(d^-1\right)$-time partition oracles for minor-free graph classes., , and . FOCS, page 257-268. IEEE, (2021)HyperHeadTail: a Streaming Algorithm for Estimating the Degree Distribution of Dynamic Multigraphs., and . ASONAM, page 31-39. ACM, (2017)The impossibility of low-rank representations for triangle-rich complex networks, , , and . (2019)Random Walks and Forbidden Minors I: An $n^1/2+o(1)$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs., , and . SIAM J. Comput., 52 (6): S18-216 (December 2023)andom walks and forbidden minors II: A poly(dε-1)$-query tester for minor-closed properties of bounded degree graphs., , and . Electron. Colloquium Comput. Complex., (2019)Fiding forbidden minors in sublinear time: a O(n1/2 + o(1))-query one-sided tester for minor closed properties on bounded degree graphs., , and . CoRR, (2018)Finding forbidden minors in sublinear time: a O(n1/2+o(1))-query one-sided tester for minor closed properties on bounded degree graphs., , and . Electron. Colloquium Comput. Complex., (2018)Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes., , and . CoRR, (2021)