Sciweavers

3267 search results - page 15 / 654
» Generalized quasirandom graphs
Sort
View
DAM
2007
108views more  DAM 2007»
13 years 7 months ago
3D-interval-filament graphs
: 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...
Fanica Gavril
NETWORKS
2006
13 years 7 months ago
A bidirected generalization of network matrices
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 ...
Gautam Appa, Balázs Kotnyek
AAAI
2004
13 years 8 months ago
A General Solution to the Graph History Interaction Problem
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 ...
Akihiro Kishimoto, Martin Müller 0003
DM
2011
223views Education» more  DM 2011»
13 years 2 months ago
On graph equivalences preserved under extensions
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...
Zbigniew Lonc, Miroslaw Truszczynski
OL
2010
140views more  OL 2010»
13 years 2 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
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...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...