Works (3)

Updated: July 5th, 2023 15:38

2019 article

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class

27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), Vol. 144.

By: E. Demaine, T. Goodrich, K. Kloster, B. Lavallee, Q. Liu, B. Sullivan, A. Vakilian, A. Poel

Contributors: E. Demaine, T. Goodrich, K. Kloster, B. Lavallee, Q. Liu, B. Sullivan, A. Vakilian, A. Poel

author keywords: structural rounding; graph editing; approximation algorithms
TL;DR: New editing algorithms are developed that find the approximately-fewest edits required to bring a given graph into one of several important graph classes (in some cases, also approximating the target parameter of the family). (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, ORCID
Added: October 5, 2020

2016 conference paper

Asymptotic analysis of equivalences and core-structures in Kronecker-style graph models

2016 ieee 16th international conference on data mining (icdm), 829–834.

By: A. Chin*, T. Goodrich n, M. O'Brien n, F. Reidl n, B. Sullivan n & A. Poel n

TL;DR: It is proved that although several R-MAT formulations are asymptotically equivalent, their behaviour is different from that of SKG, and a case where asymPTotic analysis reveals unexpected behavior within a given model is considered. (via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries, ORCID
Added: August 6, 2018

2015 article

Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs

ALGORITHMS AND MODELS FOR THE WEB GRAPH, (WAW 2015), Vol. 9479, pp. 29–41.

By: M. Farrell*, T. Goodrich n, N. Lemons, F. Reidl*, F. Villaamil* & B. Sullivan n

Contributors: M. Farrell*, T. Goodrich n, N. Lemons, F. Reidl*, F. Villaamil* & B. Sullivan n

Sources: Web Of Science, NC State University Libraries, ORCID
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.