Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
534
search results - page 7 / 107
»
Diameter critical graphs
Sort
relevance
views
votes
recent
update
View
thumb
title
26
click to vote
ALGORITHMICA
2007
117
views
more
ALGORITHMICA 2007
»
Random Geometric Graph Diameter in the Unit Ball
13 years 9 months ago
Download
math.iit.edu
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
Robert B. Ellis, Jeremy L. Martin, Catherine H. Ya...
claim paper
Read More »
27
click to vote
ICALP
2004
Springer
112
views
Programming Languages
»
more
ICALP 2004
»
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
14 years 3 months ago
Download
www.mpi-inf.mpg.de
Lars Arge, Ulrich Meyer, Laura Toma
claim paper
Read More »
24
click to vote
WG
2009
Springer
110
views
Theoretical Computer Science
»
more
WG 2009
»
Cycles, Paths, Connectivity and Diameter in Distance Graphs
14 years 2 months ago
Download
www.lirmm.fr
Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz ...
claim paper
Read More »
26
click to vote
CATS
2008
195
views
Applied Computing
»
more
CATS 2008
»
On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2
13 years 11 months ago
Download
crpit.com
Using eigenvalue analysis, it was shown by Erd
Mirka Miller, Minh Hoang Nguyen, Guillermo Pineda-...
claim paper
Read More »
27
click to vote
WALCOM
2008
IEEE
127
views
Algorithms
»
more
WALCOM 2008
»
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
13 years 11 months ago
Download
networking.khu.ac.kr
In this paper, a fast algorithm is proposed to calculate kth power of an n
Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abd...
claim paper
Read More »
« Prev
« First
page 7 / 107
Last »
Next »