• 연결,connection . . . . 59 matches
       [[connected_set]] =,connected_set . connected_set
       connected set
       [[MathWorld:ConnectedSet]] = https://mathworld.wolfram.com/ConnectedSet.html
       "connected set"
       KmsE:"connected set"
       Ndict:"connected set"
       Ggl:"connected set"
       https://en.wiktionary.org/wiki/connected_set x [[Date(2023-11-18T13:02:53)]]
       [[connected_space]] =,connected_space . connected_space
       connected space
       KmsE:"connected space"
       [[WtEn:connected_space]] = https://en.wiktionary.org/wiki/connected_space
       [[MathWorld:ConnectedSpace]] = https://mathworld.wolfram.com/ConnectedSpace.html
       [[WpEn:Connected_space]] = https://en.wikipedia.org/wiki/Connected_space
       [[connectedness_locus]] =,connectedness_locus . connectedness_locus
       connectedness locus
       https://en.wikipedia.org/wiki/Connectedness_locus
        ([[Date(2023-11-18T13:02:53)]] 첫문장 "In one-dimensional [[complex_dynamics]] =,complex_dynamics . complex_dynamics { '''complex dynamics''' MathWorld:ComplexDynamics ? https://en.wikipedia.org/wiki/Complex_dynamics WtEn:complex_dynamics = https://en.wiktionary.org/wiki/complex_dynamics x [[Date(2023-11-18T13:02:53)]] / "complex dynamics" Ggl:"complex dynamics" }, the '''connectedness locus''' of a parameterized family of one-variable [[정칙함수,holomorphic_function]] =정칙함수,holomorphic_function =,holomorphic_function 정칙함수 holomorphic_function { '''holomorphic function''' '''정칙함수'''(KMS) via KmsE:"holomorphic function" .... Ndict:정칙함수 ... https://en.wiktionary.org/wiki/holomorphic_function x [[Date(2023-11-18T13:02:53)]] .... https://en.wikipedia.org/wiki/Holomorphic_function MathWorld:HolomorphicFunction "holomorphic function" Ggl:"holomorphic function" }s is a subset of the parameter space which consists of those parameters for which the corresponding Julia set is connected.")
       == 단순연결 ? / simple connection (n.) / simply connected (adj.) ? CHK ==
       https://mathworld.wolfram.com/SimplyConnected.html
• 성분,component . . . . 45 matches
        어떤 [[undirected_graph]]의 '''component'''란, 그것의 한 [[conneceted_subgraph]]인데, 더 큰 connected subgraph의 [[부분,part]]이 아닌 것.
        "...Components are sometimes called '''connected components'''." ''즉 [[그래프이론,graph_theory]]에서, '''component'''란 것 자체가 '''conneceted component'''를 뜻함.
        connected_component
        connected component
        WtEn:connected_component
        https://everything2.com/title/connected+component
        WpEn:Connected_component - graph theory / topology 두 가지에 대한 disambiguation.
        Ndict:"connected component"
        Ggl:"connected component"
        Bing:"connected component"
        "connected component"
        path connected component
        https://everything2.com/title/path+connected+component
        Ndict:"path connected component"
        Ggl:"path connected component"
        Bing:"path connected component"
        "path connected component"
        [[biconnected_component]] =,biconnected_component =,biconnected_component . biconnected_component
        biconnected component
        WpEn:Biconnected_component
• 그래프이론,graph_theory . . . . 24 matches
       [[connected_component]] =,connected_component . connected_component
       connected component
       ... Google:connected.component
        "In graph theory, a component of an undirected graph is a connected subgraph that is not part of any larger connected subgraph."
       == connected graph ==
       connected graph
       [[연결그래프,connected_graph]]
       https://mathworld.wolfram.com/ConnectedGraph.html
       [[connectivity]] or [[connectedness]] ? ... 아무튼 [[연결,connection]]
       == biconnected graph ==
       biconnected graph
       [[biconnected_graph]] =,biconnected_graph . biconnected_graph
       https://mathworld.wolfram.com/BiconnectedGraph.html
       WpEn:Biconnected_graph = https://en.wikipedia.org/wiki/Biconnected_graph
       == disconnected graph ==
       disconnected graph
       [[disconnected_graph]]
       https://mathworld.wolfram.com/DisconnectedGraph.html
• 합,sum . . . . 12 matches
       [[connected_sum]] =,connected_sum =,connected_sum . connected_sum
       connected_sum
       WtEn:connected_sum ?
       connected sum
       연결된 합 ... KmsE:"connected sum"
       https://en.wikipedia.org/wiki/Connected_sum
       "connected sum"
       Ndict:"connected sum"
       Ggl:"connected sum"
• 레이어,layer . . . . 9 matches
       fully-connected layer
       [[fully-connected_layer]]
       fully-connected_layer
       "fully-connected layer"
       Ggl:"fully-connected layer"
       Naver:"fully-connected layer"
       fully_connected_feedforward_layer
       fully connected feedforward layer
       Ggl:"fully connected feedforward layer"
• 연결성,connectivity . . . . 9 matches
       WpEn:Edge_connectivity redir to WpEn:K-edge-connected_graph
       [[connected_component]] =,connected_component . connected_component
       [[WtEn:connected_component]]
       [[strongly_connected_component]] =,strongly_connected_component . strongly_connected_component
       [[WtEn:strongly_connected_component]]
• 사이클,cycle . . . . 5 matches
       A [[connected_graph]] without '''cycles''' is called a [[트리,tree]]." // WtEn:connected_graph WpEn:connected_graph
        each two adjacent vertices in the sequence are connected by an [[에지,edge]] in $G$, and
        each two nonadjacent vertices in the sequence are not connected by any edge in $G$.
• 네트워크과학,network_science . . . . 4 matches
       [[트리,tree]] : connected, undirected_network 의 일종, closed_loop 가 존재하지 않는 graph.
        vertex들의 sequence인데, 그 모든 consecutive vertex pair가 connected edge인 - 연결된 그래서 edge가 존재하는 - ?
        모든 vertex들이 fully connected된 vertex set.
        (number of pairs of neighbors of i that are connected) / (number of pairs of neighbors of i)
• 네트워크과학,network_science,netsci . . . . 4 matches
       [[트리,tree]] : connected, undirected_network 의 일종, closed_loop 가 존재하지 않는 graph.
        vertex들의 sequence인데, 그 모든 consecutive vertex pair가 connected edge인 - 연결된 그래서 edge가 존재하는 - ?
        모든 vertex들이 fully connected된 vertex set.
        (number of pairs of neighbors of i that are connected) / (number of pairs of neighbors of i)
• 네트워크,network . . . . 2 matches
       node의 clustering coefficient란, fraction of pairs of the node's neighbors that are connected to each other.
       the tendency of similar people to be connected (Menczer)
• 식별자,identifier . . . . 2 matches
        [[MAC주소,MAC_address]], (가 internet-connected machine의)
        [[IP주소,IP_address]], (가 internet-connected machine의)
• 절단,cut . . . . 2 matches
        [[connected_graph]]를 [[disconnected_graph]]로 만드는
• 정규식,regular_expression,regex . . . . 2 matches
       ReDoS: Regular Expression Denial of Service (gitconnected.com)
       https://levelup.gitconnected.com/the-regular-expression-denial-of-service-redos-cheat-sheet-a78d0ed7d865
• 트리,tree . . . . 2 matches
       "an undirected graph in which every connected component has at most one cycle"
       [[순환,cycle]]을 갖지 않는 [[연결그래프,connected_graph]]. (wpko)
• GenPhyExercises . . . . 1 match
       The circuit is equivalent to a cell of emf (E2-E1), connected to a resistance of 2r.
• 독립성,independence . . . . 1 match
        a [[측도,measure]] of how closely connected,,[[연결,connection]],, two routine,,[[루틴,routine]],,s or module,,[[모듈,module]],,s are;
• 성질,property . . . . 1 match
        ex. [[연결성,connectedness]], [[컴팩트성,compactness]]
• 원판,disk . . . . 1 match
        "disk is inserted into a floppy disk drive (FDD) connected to or inside a computer or other device"(WpEn:Floppy_disk)
• 접속,connection . . . . 1 match
       https://everything2.com/title/Connected
• 정의역,domain . . . . 1 match
        [[위상수학,topology]]에서 domain은 [[connected_open_set]]. { [[연결,connection]] [[열린집합,open_set]] }

You can also click here to search title.