32 citations · 33 across the 7 of their papers we have counts for
7 papers
Tracking and Predicting Evolution of Social Communities
Mark Goldberg, Malik Magdon-Ismail, Srinivas Nambirajan +1
We develop an algorithmic framework for studying the evolution of communities in social networks. We begin with the theoretical foundation, from which we conclude that an evolution…
A conditional greedy algorithm for edge-coloring
Mark K. Goldberg
We present a novel algorithm for edge-coloring of multigraphs. The correctness of this algorithm for multigraphs with ( is the chromatic edge number and is the m…
On degree-colorings of multigraphs
Mark K. Goldberg
A notion of degree-coloring is introduced; it captures some, but not all properties of standard edge-coloring. We conjecture that the smallest number of colors needed for degree-co…
Extracting Hidden Groups and their Structure from Streaming Interaction Data
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon-Ismail +1
When actors in a social network interact, it usually means they have some general goal towards which they are collaborating. This could be a research collaboration in a company or…
Embedding a Forest in a Graph
Mark Goldberg, Malik Magdon-Ismail
For \math{p\ge 1}, we prove that every forest with \math{p} trees whose sizes are can be embedded in any graph containing at least vertices…
Path optimization and near-greedy analysis for graph partitioning: an empirical study
Jonathan Berry, Mark Goldberg
This paper presents the results of an experimental study of graph partitioning. We describe a new heuristic technique, path optimization, and its application to two variations of g…