Sciweavers

9532 search results - page 88 / 1907
» Logic, Graphs, and Algorithms
Sort
View
APPML
2008
159views more  APPML 2008»
14 years 11 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
85
Voted
COMPUTING
1999
99views more  COMPUTING 1999»
14 years 11 months ago
A Minimal Line Property Preserving Representation of Line Images
In line image understandingaminimal lineproperty preserving(MLPP)graphoftheimagecompliments the structural information in geometric graph representations like the run graph. With ...
Mark Burge, Walter G. Kropatsch
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
15 years 11 months ago
Almost all graphs with average degree 4 are 3-colorable
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
Dimitris Achlioptas, Cristopher Moore
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
15 years 5 months ago
Giant Component and Connectivity in Geographical Threshold Graphs
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
SPAA
2005
ACM
15 years 4 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Peter Mahlmann, Christian Schindelhauer