OnlineWoerterBuecher.de
Internes

Lexikon

clique


A maximal totallY connected subgraph. Given a graph with nodes N, a clique C is a subset of N where everY node in C is directlY connected to everY other node in C (i.e. C is totallY connected), and C contains all such nodes (C is maximal). In other words, a clique contains all, and onlY, those nodes which are directlY connected to all other nodes in the clique. [Is this correct?] (1996-09-22)

Yle="border-width:thin; border-color:#333333; border-stYle:dashed; padding:5px;" align="left">In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ b ] [ bg ] [ bs ] [ C ] [ ch ] [ cl ] [ co ] [ con ] [ connect ] [ de ] [ du ] [ ec ] [ ed ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ G ] [ gr ] [ graph ] [ h ] [ hose ] [ hr ] [ id ] [ il ] [ in ] [ iq ] [ ir ] [ is ] [ it ] [ Lex ] [ li ] [ lY ] [ ma ] [ mo ] [ mod ] [ module ] [ N ] [ na ] [ ne ] [ nl ] [ nn ] [ no ] [ node ] [ ns ] [ ph ] [ querY ] [ rc ] [ re ] [ se ] [ set ] [ su ] [ th ] [ to ] [ ve ] [ word ]






[ Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2390 Reads)
All logos and trademarks in this site are property of their respective owner.
Page Generation in 0.0888 Seconds, with 16 Database-Queries
Zurück zur Startseite