Sciweavers

145 search results - page 3 / 29
» A new characterization of HH-free graphs
Sort
View
IJKDB
2010
162views more  IJKDB 2010»
13 years 8 months ago
New Trends in Graph Mining: Structural and Node-Colored Network Motifs
Searching for repeated features characterizing biological data is fundamental in computational biology. When biological networks are under analysis, the presence of repeated modul...
Francesco Bruno, Luigi Palopoli, Simona E. Rombo
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 11 months ago
Rigidity of Graph Joins and Hendrickson's Conjecture
Whiteley [9] gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined gr...
Timothy Sun, Chun Ye
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
13 years 8 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
Vincent Limouzy
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
14 years 2 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
DM
2007
101views more  DM 2007»
13 years 10 months ago
Threshold graphs, shifted complexes, and graphical complexes
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
Caroline J. Klivans