Sciweavers

3267 search results - page 144 / 654
» Generalized quasirandom graphs
Sort
View
132
Voted
DIAGRAMS
2008
Springer
15 years 6 months ago
Supporting Reasoning and Problem-Solving in Mathematical Generalisation with Dependency Graphs
Abstract. We present a brief description of the design of a diagrambased system that supports the development of thinking about mathematical generalisation. Within the software, th...
Sergio Gutiérrez Santos, Darren Pearce, Eir...
JGT
2010
103views more  JGT 2010»
15 years 3 months ago
Characterizing 3-connected planar graphs and graphic matroids
: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...
Manoel Lemos, Talmage James Reid, Haidong Wu
DAC
2008
ACM
16 years 5 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
16 years 5 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
16 years 2 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...