Identifying the split and join patterns of dependency graphs is an essential step in Heuristics Mining process discovery methods. The existing methods determine the split/join patterns (consisting of ...

How do the k-core structures of real-world graphs look like? What are the common patterns and the anomalies? How can we use them for algorithm design and applications? A k-core is the maximal subgraph ...