1 citations · 3 across the 12 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019★ 1 cited
Perfect matchings and Hamilton cycles in uniform attachment graphs
Huseyin Acan
We study Hamilton cycles and perfect matchings in a uniform attachment graph. In this random graph, vertices are added sequentially, and when a vertex is created, it makes …
math.CO2019
Giant descendant trees, matchings and independent sets in the age-biased attachment graphs
Huseyin Acan, Alan Frieze, Boris Pittel
We study two models of an age-biased graph process: the -version of the preferential attachment graph model (PAM) and the uniform attachment graph model (UAM), with attachme…
cs.DS2019
Succinct Data Structures for Families of Interval Graphs
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo +1
We consider the problem of designing succinct data structures for interval graphs with vertices while supporting degree, adjacency, neighborhood and shortest path queries in op…