Sciweavers

3267 search results - page 45 / 654
» Generalized quasirandom graphs
Sort
View
AIPS
2008
15 years 1 months ago
Causal Graphs and Structurally Restricted Planning
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...
Hubie Chen, Omer Giménez
DAM
2010
86views more  DAM 2010»
14 years 11 months ago
Minimum fill-in and treewidth of split+ke and split+kv graphs
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...
Federico Mancini
DAM
2008
109views more  DAM 2008»
14 years 11 months ago
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
EJC
2010
14 years 11 months ago
Shilla distance-regular graphs
A Shilla distance-regular graph (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divide...
Jack H. Koolen, Jongyook Park
DM
2006
144views more  DM 2006»
14 years 11 months ago
On almost self-complementary graphs
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
Primoz Potocnik, Mateja Sajna