3 papers
cs.DS2023
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
Xinwei Cai, Xiangyu Ke, Kai Wang +4
Bipartite graphs characterize relationships between two different sets of entities, like actor-movie, user-item, and author-paper. The butterfly, a 4-vertices 4-edges (2,2)-bicliqu…
math.CO2018
An Improved Algorithm for Counting Graphical Degree Sequences
Kai Wang, Troy Purvis
We present an improved version of a previous efficient algorithm that computes the number of zero-free graphical degree sequences of length . A main ingredient of the imp…
math.CO2018
An efficient algorithm to test forcibly-connectedness of graphical degree sequences
Kai Wang
We present an algorithm to test whether a given graphical degree sequence is forcibly connected or not and prove its correctness. We also outline the extensions of the algorithm to…