Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CIARP
2008
Springer

favoriteEmaildiscussreport

110views Pattern Recognition» more CIARP 2008»

Calculating the Number of Tunnels

13 years 7 months ago

Calculating the Number of Tunnels

Download www.mi.auckland.ac.nz

This report1 considers 2-regions of grid cubes and proposes an algorithm for calculating the number of tunnels of such a region. The graph-theoretical algorithm proceeds layer by layer; a proof of its correctness is provided, and its time complexity is also given.

Fajie Li, Reinhard Klette

Real-time Traffic

Algorithm Proceeds Layer | CIARP 2008 | Grid Cubes | Pattern Recognition | Report1 Considers 2-regions |

claim paper

Related Content

» TunnelSim Decision support tool for planning tunnel construction using computer simulation

» Reduction of Direct Tunneling Power Dissipation during Behavioral Synthesis of Nanometer C...

» Testing for tunneling opens

» A New Preemption Policy For MPLSTE Networks

» Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis

» Real Number Calculations and Theorem Proving

» Verified Real Number Calculations A Library for Interval Arithmetic

» Numerical calculation of the density of prime numbers with a given least primitive root

» Comparison of algorithms to calculate quadratic irregularity of prime numbers

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	CIARP
Authors	Fajie Li, Reinhard Klette

Comments (0)