Sciweavers

9532 search results - page 51 / 1907
» Logic, Graphs, and Algorithms
Sort
View
CGVR
2008
15 years 16 days ago
A Graph Drawing Algorithm for the Game of Sprouts
- A graph drawing algorithm for the Game of Sprouts is presented. The algorithm guarantees that the polylines that connect graph nodes are drawn smoothly and that they maintain rea...
Wayne Brown, Leemon C. Baird III
67
Voted
CADE
2006
Springer
15 years 11 months ago
Flyspeck I: Tame Graphs
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while ...
Tobias Nipkow, Gertrud Bauer, Paula Schultz
SIGECOM
2010
ACM
153views ECommerce» more  SIGECOM 2010»
14 years 9 months ago
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...
Denis Charles, Max Chickering, Nikhil R. Devanur, ...
IV
2005
IEEE
131views Visualization» more  IV 2005»
15 years 4 months ago
A Framework for Visualising Large Graphs
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
Wanchun Li, Seok-Hee Hong, Peter Eades
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
14 years 8 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima