: Gavril [GA4] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs. The complements of intervalfilament graphs are the coi...
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...