Sciweavers

3267 search results - page 139 / 654
» Generalized quasirandom graphs
Sort
View
AVI
2006
15 years 6 months ago
Task taxonomy for graph visualization
Our goal is to define a list of tasks for graph visualization that has enough detail and specificity to be useful to designers who want to improve their system and to evaluators w...
Bongshin Lee, Catherine Plaisant, Cynthia Sims Par...
107
Voted
UAI
2004
15 years 6 months ago
Iterative Conditional Fitting for Gaussian Ancestral Graph Models
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
Mathias Drton, Thomas S. Richardson
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 4 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
DM
2007
136views more  DM 2007»
15 years 4 months ago
Lower connectivities of regular graphs with small diameter
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
Camino Balbuena, Xavier Marcote
JGT
2006
98views more  JGT 2006»
15 years 4 months ago
Group chromatic number of planar graphs of girth at least 4
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
Hong-Jian Lai, Xiangwen Li