OnlineWoerterBuecher.de
Internes

Lexikon


De Bruijn graph


A class of graphs with elegant properties. De Bruijn graphs are especially easy to use for routing, with shifting of source and destination addresses. [What properties? How are they used in routing?] (1998-04-28)

In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ address ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ B ] [ ch ] [ ci ] [ cl ] [ class ] [ D ] [ dd ] [ de ] [ du ] [ ec ] [ ed ] [ eg ] [ elegant ] [ er ] [ es ] [ fi ] [ file ] [ fo ] [ for ] [ ga ] [ gr ] [ graph ] [ h ] [ hat ] [ hr ] [ hs ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ it ] [ la ] [ Lex ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ na ] [ ng ] [ op ] [ pe ] [ ph ] [ pr ] [ query ] [ rc ] [ re ] [ ro ] [ routing ] [ ru ] [ se ] [ sh ] [ so ] [ source ] [ spec ] [ st ] [ sy ] [ th ] [ to ] [ us ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2542 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0911 Seconds, with 17 Database-Queries
Zurück zur Startseite