Gotowe bibliografie tematyczne / Cut vertex

Spis treści

  1. Artykuły w czasopismach
  2. Rozprawy doktorskie
  3. Książki
  4. Części książek
  5. Streszczenia konferencji
  6. Raporty organizacyjne

Gotowa bibliografia na temat „Cut vertex”

Autor: Grafiati
Data publikacji: 3 czerwca 2025
Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Cut vertex”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Cut vertex"

1

Safeera, K., and V. Anil Kumar. "VERTEX CUT POLYNOMIAL OF GRAPHS." Advances and Applications in Discrete Mathematics 32 (June 1, 2022): 1–12. http://dx.doi.org/10.17654/0974165822028.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Cornaz, Denis, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, A. Ridha Mahjoub, and Sébastien Martin. "The vertex k-cut problem." Discrete Optimization 31 (February 2019): 8–28. http://dx.doi.org/10.1016/j.disopt.2018.07.003.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Baskar, Nivedha, Tabitha Agnes Mangam, and Rohith Raja. "On block-related derived graphs." Gulf Journal of Mathematics 18, no. 2 (2024): 70–86. https://doi.org/10.56947/gjom.v18i2.2284.

Pełny tekst źródła
Streszczenie:
The cut vertex of a graph G is a vertex whose removal increases the number of components in the graph. A maximal connected subgraph with no cut vertex is called a block of the graph. This paper introduces and analyses the block-degree of a vertex and the cut-degree of a block. The block-degree of a vertex v is the number of blocks containing v. The cut-degree of a block b is the number of cut vertices of G contained in b. Given the block-degree sequence of cut vertices of a graph, the number of blocks of the graph and bounds on the order and size of the graph are studied. The block graph (B(G)
Style APA, Harvard, Vancouver, ISO itp.
4

Vimala, S., and A. Amala. "Topologized Cut Vertex and Edge Deletion." Asian Research Journal of Mathematics 5, no. 1 (2017): 1–12. http://dx.doi.org/10.9734/arjom/2017/33108.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Li, Yalan, Shumin Zhang, and Chengfu Ye. "On Cyclic-Vertex Connectivity of n , k -Star Graphs." Mathematical Problems in Engineering 2021 (April 12, 2021): 1–4. http://dx.doi.org/10.1155/2021/5570761.

Pełny tekst źródła
Streszczenie:
A vertex subset F ⊆ V G is a cyclic vertex-cut of a connected graph G if G − F is disconnected and at least two of its components contain cycles. The cyclic vertex-connectivity κ c G is denoted as the cardinality of a minimum cyclic vertex-cut. In this paper, we show that the cyclic vertex-connectivity of the n , k -star network S n , k is κ c S n , k = n + 2 k − 5 for any integer n ≥ 4 and k ≥ 2 .
Style APA, Harvard, Vancouver, ISO itp.
6

Yurttas Gunes, Aysun, Muge Togan, Feriha Celik, and Ismail Naci Cangul. "Cut vertex and cut edge problem for topological graph indices." Journal of Taibah University for Science 13, no. 1 (2019): 1175–83. http://dx.doi.org/10.1080/16583655.2019.1695520.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

LIU, QINGHAI, ZHAO ZHANG, and ZHIHUA YU. "CYCLIC CONNECTIVITY OF STAR GRAPH." Discrete Mathematics, Algorithms and Applications 03, no. 04 (2011): 433–42. http://dx.doi.org/10.1142/s1793830911001322.

Pełny tekst źródła
Streszczenie:
For a connected graph G, a vertex subset F ⊂ V(G) is a cyclic vertex-cut of G if G - F is disconnected and at least two of its components contain cycles. The cardinality of a minimum cyclic vertex-cut of G, denoted by κc(G), is the cyclic vertex-connectivity of G. In this paper, we show that for any integer n ≥ 4, the n-dimensional star graph SGn has κc(SGn) = 6(n - 3).
Style APA, Harvard, Vancouver, ISO itp.
8

Vujošević, Saša. "Computation of edge Pi index, vertex Pi index and Szeged index of some cactus chains." Mathematica Montisnigri 54 (2022): 14–24. http://dx.doi.org/10.20948/mathmontis-2022-54-2.

Pełny tekst źródła
Streszczenie:
A cactus chain is a connected graph in which all blocks are cycles, each cycle has at most two cut-vertices and each cut-vertex is shared by exactly two cycles. In this paper we give exact values of edge PI index and vertex PI index of an arbitrary cactus chain and vertex Szeged index of some special types of cactus chains.
Style APA, Harvard, Vancouver, ISO itp.
9

Dewar, Megan, David Pike, and John Proos. "Connectivity in Hypergraphs." Canadian Mathematical Bulletin 61, no. 2 (2018): 252–71. http://dx.doi.org/10.4153/cmb-2018-005-9.

Pełny tekst źródła
Streszczenie:
AbstractIn this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of Whitney from graphs to hypergraphs. We find that, while determining a minimum weak vertex cut can be done in polynomial time and is equivalent to finding a minimum vertex cut in the 2-section of the hypergraph in question, determining a minimum strong vertex cut is NP-hard for general hypergraphs. Moreover, the problem of finding minimum strong verte
Style APA, Harvard, Vancouver, ISO itp.
10

Nazeer, Irfan, Tabasam Rashid, and Muhammad Tanveer Hussain. "Cyclic connectivity index of fuzzy incidence graphs with applications in the highway system of different cities to minimize road accidents and in a network of different computers." PLOS ONE 16, no. 9 (2021): e0257642. http://dx.doi.org/10.1371/journal.pone.0257642.

Pełny tekst źródła
Streszczenie:
A parameter is a numerical factor whose values help us to identify a system. Connectivity parameters are essential in the analysis of connectivity of various kinds of networks. In graphs, the strength of a cycle is always one. But, in a fuzzy incidence graph (FIG), the strengths of cycles may vary even for a given pair of vertices. Cyclic reachability is an attribute that decides the overall connectedness of any network. In graph the cycle connectivity (CC) from vertex a to vertex b and from vertex b to vertex a is always one. In fuzzy graph (FG) the CC from vertex a to vertex b and from verte
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Cut vertex"

1

Magnouche, Youcef. "The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms." Thesis, Paris Sciences et Lettres (ComUE), 2017. http://www.theses.fr/2017PSLED020/document.

Pełny tekst źródła
Streszczenie:
Étant donné un graphe G = (V U T, E), tel que V U T représente l'ensemble des sommets où T est un ensemble de terminaux, et une fonction poids w associée aux sommets non terminaux, le problème du séparateur de poids minimum consiste à partitionner V U T en k + 1 sous-ensembles {S, V1,..., Vk} tel qu'il n'y a aucune arête entre deux sous-ensembles différents Vi et Vj, chaque Vi contient exactement un terminal et le poids de S est minimum. Dans cette thèse, nous étudions le problème d'un point de vue polyèdral. Nous donnons deux formulations en nombres entiers pour le problème, et pour une de ce
Style APA, Harvard, Vancouver, ISO itp.
2

Seyed, Khamoushi Seyed Mohammadreza. "Scalable Streaming Graph Partitioning." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-206113.

Pełny tekst źródła
Streszczenie:
Large-scale graph-structured datasets are growing at an increasing rate. Social network graphs are an example of these datasets. Processing large-scale graphstructured datasets are central to many applications ranging from telecommunication to biology and has led to the development of many parallel graph algorithms. Performance of parallel graph algorithms largely depends on how the underlying graph is partitioned. In this work, we focus on studying streaming vertex-cut graph partitioning algorithms where partitioners receive a graph as a stream of vertices and edges and assign partitions to t
Style APA, Harvard, Vancouver, ISO itp.
3

Campos, Victor Almeida. "Um estudo do politopo e dos limites inferiores gerados pela formulaÃÃo de coloraÃÃo dos representantes." Universidade Federal do CearÃ, 2005. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=2159.

Pełny tekst źródła
Streszczenie:
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico<br>O problema de coloraÃÃo de vÃrtices à considerado um dos modelos mais estudados em teoria dos grafos pela sua relevÃncia em campos prÃticos e teÃricos. Do ponto de vista teÃrico, o problema de coloraÃÃo à NP - DifÃcil. AlÃm disto, foi classificado entre os problemas mais difÃceis de NP, no sentido de que achar uma aproximaÃÃo para o nÃmero cromÃtico tambÃm à NP - DifÃcil. A importÃncia do problema de coloraÃÃo tem incentivado a investigar mÃtodos para encontrar limitantes inferiores prÃximos do nÃmero cromÃtico. Historicamente, o
Style APA, Harvard, Vancouver, ISO itp.
4

Smith, Caitlin Vanessa. "Non conventionalité et généricité dans la catégorisation lexicale d'apprenants en anglais L2 : le cas de "cut" et "break"." Phd thesis, Université Toulouse le Mirail - Toulouse II, 2013. http://tel.archives-ouvertes.fr/tel-00967413.

Pełny tekst źródła
Streszczenie:
Notre travail se focalise sur deux phénomènes observés dans le cadre de l'apprentissage de l'anglais langue seconde (L2) chez des adultes francophones: d'une part, l'usage non conventionnel de verbes, et d'autre part, l'importance du taux de production des verbes génériques (vs spécifiques). Notre population est constituée d'un groupe d'étudiants universitaires francophones en situation d'apprentissage de l'anglais de niveau B1 (population cible), ainsi que d'un groupe de locuteurs d'anglais L1 (population de référence), placés en situation de dénomination orale de 42 vidéos d'actions de type
Style APA, Harvard, Vancouver, ISO itp.
5

Chen, Ziang. "Justice and Prudence : Political Virtues in Gerald Odonis's Expositio cum quaestionibus super libros Ethicorum." Electronic Thesis or Diss., Paris, EHESS, 2020. http://www.theses.fr/2020EHES0077.

Pełny tekst źródła
Streszczenie:
Cette thèse doctorale étudie la question de la valeur morale de l'individu et de son existence relative au cadre sociétal et institutionnel, sur la base del'Expositio super libros ethicorum de Guiral Ot. Écrit pendant la première moitié des années 1320, il s’agit du premier commentaire complet écrit par un théologien franciscain sur l’Éthique à Nicomaque d’Aristote. Le commentaire offre un point de vue sur le paysage intellectuel du XIVe siècle, sur l'état des savoirs et de l'éducation, sur la réception d'Aristote, et sur les pensées morales et politiques. Cette œuvre illustre les traditions i
Style APA, Harvard, Vancouver, ISO itp.
6

Khaoulani, Sohayb. "Traitement d'eaux usées par adsorption sur des polymères de cyclodextrine et développement de capteurs chimiques à base de membranes de verres de chalcogénures destinées à la détection des ions Hg²⁺." Thesis, Littoral, 2015. http://www.theses.fr/2015DUNK0386/document.

Pełny tekst źródła
Streszczenie:
L'objectif de ce travail a consisté à identifier des polluants émergents dans des eaux usées issues de stations d'épuration ainsi que dans le milieu naturel et à proposer une méthode de remédiation et un suivi de ces polluants. Dans un premier temps, nous avons identifié les polluants organiques contenus dans les échantillons d'eaux usées et issues du milieu naturel par chromatographie en phase liquide ou gazeuse couplée à une spectrométrie de masse, chromatographie en phase gazeuse par espace de tête statique et par spectrométrie par torche à plasma couplée à une spectrométrie de masse. Diffé
Style APA, Harvard, Vancouver, ISO itp.
7

Georgiou, Konstantinos. "Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations." Thesis, 2010. http://hdl.handle.net/1807/26271.

Pełny tekst źródła
Streszczenie:
The inapproximability for NP-hard combinatorial optimization problems lies in the heart of theoretical computer science. A negative result can be either conditional, where the starting point is a complexity assumption, or unconditional, where the inapproximability holds for a restricted model of computation. Algorithms based on Linear Programming (LP) and Semidefinite Programming (SDP) relaxations are among the most prominent models of computation. The related and common measure of efficiency is the integrality gap, which sets the limitations of the associated algorithmic schemes. A number of
Style APA, Harvard, Vancouver, ISO itp.
8

Shah, Chintan D. "Boxicity, Cubicity And Vertex Cover." Thesis, 2008. https://etd.iisc.ac.in/handle/2005/890.

Pełny tekst źródła
Streszczenie:
The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding vertices of G are adjacent. An axis-parallel box is a generalized rectangle with sides parallel to the coordinate axes. If additionally, we restrict all sides of the rectangle to be of unit length, the new parameter so obtained is called the cubicity of the graph G, denoted by cub(G). F.S. Roberts had shown that for a graph G with n vertices, box(G) ≤ and cub(G) ≤ . A mi
Style APA, Harvard, Vancouver, ISO itp.
9

Shah, Chintan D. "Boxicity, Cubicity And Vertex Cover." Thesis, 2008. http://hdl.handle.net/2005/890.

Pełny tekst źródła
Streszczenie:
The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding vertices of G are adjacent. An axis-parallel box is a generalized rectangle with sides parallel to the coordinate axes. If additionally, we restrict all sides of the rectangle to be of unit length, the new parameter so obtained is called the cubicity of the graph G, denoted by cub(G). F.S. Roberts had shown that for a graph G with n vertices, box(G) ≤ and cub(G) ≤ . A min
Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "Cut vertex"

1

Edward, Lear. The owl and the pussy-cat. Trumpet Club, 1991.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Edward, Lear. The owl and the pussy cat went to sea: And other nonsense verse. Global Book Pub. Pty., 2000.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Edward, Lear. The owl & the pussy-cat & other nonsense. Beehive, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Edward, Lear. The owl & the pussy-cat & other nonsense. Silver Burdett Co., 1987.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Edward, Lear. The owl and the pussy-cat. Candlewick Press, 1997.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Lear, Edward. The owl and the pussy-cat. Clarion Books, 1987.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Lear, Edward. The owl and the pussy-cat. Harper & Row, 1987.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Edward, Lear. The owl and the pussy cat. Atheneum Books for Young Readers, 1996.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Edward, Lear. The owl and the pussy-cat. Clarion Books, 1987.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Edward, Lear. The owl and the pussy cat. Walker Books, 1991.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Cut vertex"

1

Rahimian, Fatemeh, Amir H. Payberah, Sarunas Girdzijauskas, and Seif Haridi. "Distributed Vertex-Cut Partitioning." In Distributed Applications and Interoperable Systems. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-43352-2_15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Changat, Manoj, Ferdoos Hossein Nezhad, and Peter F. Stadler. "Cut Vertex Transit Functions of Hypergraphs." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67899-9_17.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Atas, Furkan, and Mehmet Burak Akgun. "Exploiting Vertex-Cut Partitioning in Distributed Graph Generation." In Studies in Computational Intelligence. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-82435-7_33.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

de Verdière, Éric Colin. "Shortest Cut Graph of a Surface with Prescribed Vertex Set." In Algorithms – ESA 2010. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15781-3_9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Sun, Rujun, Lufei Zhang, Zuoning Chen, and Ziyu Hao. "A Balanced Vertex Cut Partition Method in Distributed Graph Computing." In Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23862-3_5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Uchoa, Eduardo, and Marcus Poggi de Aragão. "Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48777-8_33.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Benjamin, Bergougnoux, Charis Papadopoulos, and Jan Arne Telle. "Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width." In Graph-Theoretic Concepts in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-60440-0_31.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Wang, Jie, and Dagang Li. "SWR: Using Windowed Reordering to Achieve Fast and Balanced Heuristic for Streaming Vertex-Cut Graph Partitioning." In Algorithms and Architectures for Parallel Processing. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-38991-8_2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Frishter, Lyudmila. "Photoelasticity-Based Study of Stress-Strain State in the Area of the Plain Domain Boundary Cut-Out Area Vertex." In International Scientific Conference Energy Management of Municipal Transportation Facilities and Transport EMMFT 2017. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70987-1_89.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Dai, Qionghai, and Yue Gao. "Typical Hypergraph Computation Tasks." In Artificial Intelligence: Foundations, Theory, and Algorithms. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-0185-2_5.

Pełny tekst źródła
Streszczenie:
AbstractAfter hypergraph structure generation for the data, the next step is how to conduct data analysis on the hypergraph. In this chapter, we introduce four typical hypergraph computation tasks, including label propagation, data clustering, imbalance learning, and link prediction. The first typical task is label propagation, which is to predict the labels for the vertices, i.e., assigning a label to each unlabeled vertex in the hypergraph, based on the labeled information. In general cases, label propagation is to propagate the label information from labeled vertices to unlabeled vertices t
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Cut vertex"

1

Zhou, Yangming, Zhibin Jiang, and MengChu Zhou. "Simulated Hill Climbing Search for the Solutions of k-Vertex Cut Problems." In 2024 IEEE 20th International Conference on Automation Science and Engineering (CASE). IEEE, 2024. http://dx.doi.org/10.1109/case59546.2024.10711754.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Diesel, Adilson Luiz, Eugenio Jose Agrizzi, and Giovanna Cypriano Lage. "A FORÇA DO CINTURÃO VERDE NO DESEMPENHO AMBIENTAL DA CST." In 36º Seminário de Fusão, Refino e Solidificação dos Metais - Internacional. Editora Blucher, 2005. https://doi.org/10.5151/2594-5300-2004-13872-0058.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Mykhailenko, Hlib, Giovanni Neglia, and Fabrice Huet. "Which metrics for vertex-cut partitioning?" In 2016 11th International Conference for Internet Technology and Secured Transactions (ICITST). IEEE, 2016. http://dx.doi.org/10.1109/icitst.2016.7856670.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Kashyap, Navin. "The Vertex-Cut Bound and its applications." In 2008 International Symposium on Information Theory and Its Applications (ISITA). IEEE, 2008. http://dx.doi.org/10.1109/isita.2008.4895506.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Sajjad, Hooman Peiro, Amir H. Payberah, Fatemeh Rahimian, Vladimir Vlassov, and Seif Haridi. "Boosting Vertex-Cut Partitioning for Streaming Graphs." In 2016 IEEE International Congress on Big Data (BigData Congress). IEEE, 2016. http://dx.doi.org/10.1109/bigdatacongress.2016.10.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Jiang, Yonggang, and Sagnik Mukhopadhyay. "Finding a Small Vertex Cut on Distributed Networks." In STOC '23: 55th Annual ACM Symposium on Theory of Computing. ACM, 2023. http://dx.doi.org/10.1145/3564246.3585201.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Kandappan, Malathy, and Meenakshi Subramanian. "Minimum total dominating energy of cut vertex graphs." In ADVANCES IN SUSTAINABLE CONSTRUCTION MATERIALS. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0120710.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Ugurlu, Onur, Murat Ersen Berberler, Gozde Kizilates, and Mehmet Kurt. "New algorithm for finding minimum vertex cut set." In 2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI). IEEE, 2012. http://dx.doi.org/10.1109/icpci.2012.6486470.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Rad, Hadis Cheraghzade, and Reza Azmi. "CLDA: Vertex-cut partitioning for streaming power-law graphs." In 2017 9th International Conference on Information and Knowledge Technology (IKT). IEEE, 2017. http://dx.doi.org/10.1109/ikt.2017.8258626.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Beseri Sevim, Tina, Hakan Kutucu, and Murat Ersen Berberler. "New mathematical model for finding minimum vertex cut set." In 2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI). IEEE, 2012. http://dx.doi.org/10.1109/icpci.2012.6486469.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Cut vertex"

1

Mueller, C., S. J. Piercey, M. G. Babechuk, and D. Copeland. Stratigraphy and lithogeochemistry of the Goldenville horizon and associated rocks, Baie Verte Peninsula, Newfoundland. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/328990.

Pełny tekst źródła
Streszczenie:
The Goldenville horizon in the Baie Verte Peninsula is an important stratigraphic horizon that hosts primary (Cambrian to Ordovician) exhalative magnetite and pyrite and was a chemical trap for younger (Silurian to Devonian) orogenic gold mineralization. The horizon is overlain by basaltic flows and volcaniclastic rocks, is intercalated with variably coloured argillites and cherts, and underlain by mafic volcaniclastic rocks; the entire stratigraphy is cut by younger fine-grained mafic dykes and coarser gabbro. Lithogeochemical signatures of the Goldenville horizon allow it to be divided into
Style APA, Harvard, Vancouver, ISO itp.
2

Pilote, J. L., S. J. Piercey, and P. Mercier-Langevin. Stratigraphy and hydrothermal alteration of the Ming Cu-Au volcanogenic massive-sulphide deposit, Baie Verte Peninsula, Newfoundland. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2014. http://dx.doi.org/10.4095/295145.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Pilote, J. L., and S. J. Piercey. Volcanostratigraphy of the 1807 zone of the Ming Cu-Au volcanogenic massive-sulphide deposit, Baie Verte Peninsula, northern Newfoundland. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2013. http://dx.doi.org/10.4095/293128.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Pilote, J. L., S. J. Piercey, and P. Mercier-Langevin. Volcanic architecture and alteration assemblages of the Ming Cu-Au-(Zn-Ag) VMS deposit, Baie Verte, Newfoundland and Labrador: implications for Au-enrichment processes and exploration. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2015. http://dx.doi.org/10.4095/296553.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Cai, Manlin, Donna Lero, and Sylvia Fuller. Expose de politiques : Politiques soins/travail pour une gestion des soins quotidiens et des soins imprévisibles. L’Institut Vanier de la famille, 2025. https://doi.org/10.61959/esnt2797f.

Pełny tekst źródła
Streszczenie:
Les parents de jeunes enfants qui ont un emploi sont appelés à gérer un éventail de responsabilités liées aux soins quotidiens. Celles-ci peuvent être prévisibles, comme le fait d’aller reconduire ou chercher les enfants à l’école ou au service de garde, ou imprévisibles, comme les soins à donner à un enfant malade ou la gestion de perturbations liées à la garde des enfants. Les politiques soins/travail, notamment les modalités de travail flexibles, les congés liés aux responsabilités familiales et les congés de maladie, jouent un rôle fondamental en permettant aux parents et autres personnes
Style APA, Harvard, Vancouver, ISO itp.
6

Anderson, Zachary W., Greg N. McDonald, Elizabeth A. Balgord, and W. Adolph Yonkee. Interim Geologic Map of the Browns Hole Quadrangle, Weber and Cache Counties, Utah. Utah Geological Survey, 2023. http://dx.doi.org/10.34191/ofr-760.

Pełny tekst źródła
Streszczenie:
The Browns Hole quadrangle is in Weber and Cache Counties of northern Utah and covers the eastern part of Ogden Valley, a rapidly developing area of the Wasatch Range. The Middle and South Forks of the Ogden River bisect the quadrangle and are important watersheds and recreational areas to the communities of Ogden Valley and the Wasatch Front. The towns of Huntsville and Eden are just west of the quadrangle, unincorporated communities with year-round residents are present throughout the quadrangle, and numerous summer-cabin communities are present in the eastern part of the quadrangle. A porti
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Cut vertex” dla poszczególnych typów źródeł:
Artykuły w czasopismach Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii