Sciweavers

4171 search results - page 82 / 835
» Choice numbers of graphs
Sort
View
DM
2002
116views more  DM 2002»
15 years 6 months ago
Star forests, dominating sets and Ramsey-type problems
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
ISM
2006
IEEE
122views Multimedia» more  ISM 2006»
16 years 11 days ago
SuperGraph Visualization
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle larg...
José Fernando Rodrigues Jr., Agma J. M. Tra...
DM
2002
97views more  DM 2002»
15 years 6 months ago
Resonance graphs of catacondensed even ring systems are median
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric differenc...
Sandi Klavzar, Petra Zigert, Gunnar Brinkmann
BMCBI
2008
139views more  BMCBI 2008»
15 years 6 months ago
The C1C2: A framework for simultaneous model selection and assessment
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...
Martin Eklund, Ola Spjuth, Jarl E. S. Wikberg
APPML
2008
159views more  APPML 2008»
15 years 6 months ago
The rook problem on saw-toothed chessboards
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j)...
Hon-Chan Chen, Ting-Yem Ho