Search Results for author:
Found 5 papers, 2 papers with code
Fast Maximum $k$-Plex Algorithms Parameterized by Small Degeneracy Gaps
We define a novel parameter of the input instance, $g_k(G)$, the gap between the degeneracy bound and the size of the maximum $k$-plex in the given graph, and present an exact algorithm parameterized by this $g_k(G)$, which has a worst-case running time polynomial in the size of the input graph and exponential in $g_k(G)$.
Facility Location Games Beyond Single-Peakedness: the Entrance Fee Model
Thus, the cost of each agent is determined by both the distance to the facility and the entrance fee of the facility.
Listing Maximal k-Plexes in Large Real-World Graphs
Our first contribution is algorithm ListPlex that lists all maximal $k$-plexes in $O^*(\gamma^D)$ time for each constant $k$, where $\gamma$ is a value related to $k$ but strictly smaller than 2, and $D$ is the degeneracy of the graph that is far less than the vertex number $n$ in real-word graphs.
Enhancing Balanced Graph Edge Partition with Effective Local Search
The graph edge partition problem, which is to split the edge set into multiple balanced parts to minimize the total number of copied vertices, has been widely studied from the view of optimization and algorithms.
Object Reachability via Swaps under Strict and Weak Preferences
We first consider whether an object is reachable for a given agent under a social network, where a trade between two agents is allowed if they are neighbors in the network and no participant has a deficit from the trade.
