Добірка наукової літератури з теми "Cover graph"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Cover graph".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Cover graph"
Arumugam, S., Indra Rajasingh, and P. Roushini Leely Pushpam. "Characterization of a class of graphs with unique minimum graphoidal cover." Tamkang Journal of Mathematics 34, no. 4 (December 31, 2003): 317–26. http://dx.doi.org/10.5556/j.tkjm.34.2003.234.
Повний текст джерелаWang, Shiping, Qingxin Zhu, William Zhu, and Fan Min. "Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets." Journal of Applied Mathematics 2013 (2013): 1–7. http://dx.doi.org/10.1155/2013/519173.
Повний текст джерелаTsiovkina, Ludmila Yu. "ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS." Ural Mathematical Journal 7, no. 2 (December 30, 2021): 136. http://dx.doi.org/10.15826/umj.2021.2.010.
Повний текст джерелаBilar, Vergel, Maria Andrea Bonsocan, Javier Hassan, and Susan Dagondon. "Vertex Cover Hop Dominating Sets in Graphs." European Journal of Pure and Applied Mathematics 17, no. 1 (January 31, 2024): 93–104. http://dx.doi.org/10.29020/nybg.ejpam.v17i1.4978.
Повний текст джерелаScaria, Deena C., John Joy Mulloor, Liju Alex, and Gopal Indulal. "A note on some graph parameters and graph operations." Open Journal of Discrete Applied Mathematics 8, no. 2 (May 17, 2025): 32–44. https://doi.org/10.30538/psrp-odam2025.0114.
Повний текст джерелаPriscilla, Paul, and Syed Ali Fathima S. "A Study on Edge Pebbling Number, Covering Cover Edge Pebbling Number of Friendship Graphs, Odd Path and Even Path." Indian Journal of Science and Technology 16, no. 32 (August 21, 2023): 2480–84. https://doi.org/10.17485/IJST/v16i32.674.
Повний текст джерелаZHOU, JIN-XIN, and YAN-QUAN FENG. "TETRAVALENT s-TRANSITIVE GRAPHS OF ORDER TWICE A PRIME POWER." Journal of the Australian Mathematical Society 88, no. 2 (April 2010): 277–88. http://dx.doi.org/10.1017/s1446788710000066.
Повний текст джерелаAlikhani, Saeid. "Graphs Whose Certain Polynomials Have Few Distinct Roots." ISRN Discrete Mathematics 2013 (September 12, 2013): 1–8. http://dx.doi.org/10.1155/2013/195818.
Повний текст джерелаLiu, Zhi-Qiang, Ping Tang, Weixiong Zhang, and Zheng Zhang. "CNN-Enhanced Heterogeneous Graph Convolutional Network: Inferring Land Use from Land Cover with a Case Study of Park Segmentation." Remote Sensing 14, no. 19 (October 9, 2022): 5027. http://dx.doi.org/10.3390/rs14195027.
Повний текст джерелаDomagalski, Rachel, and Sivaram Narayan. "Tree Cover Number and Maximum Semidefinite Nullity of Some Graph Classes." Electronic Journal of Linear Algebra 36, no. 36 (September 30, 2020): 678–93. http://dx.doi.org/10.13001/ela.2020.5319.
Повний текст джерелаДисертації з теми "Cover graph"
Meek, Darrin Leigh. "On graph approximation heuristics : an application to vertex cover on planar graphs." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24088.
Повний текст джерелаAbdullah, Mohammed. "The cover time of random walks on graph." Thesis, King's College London (University of London), 2012. https://kclpure.kcl.ac.uk/portal/en/theses/the-cover-time-of-random-walks-on-graph(c23c303f-a6a2-4489-a059-4ade7c118106).html.
Повний текст джерелаStreib, Noah Sametz. "Planar and hamiltonian cover graphs." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/43744.
Повний текст джерелаCarney, Nicholas. "Roman Domination Cover Rubbling." Digital Commons @ East Tennessee State University, 2019. https://dc.etsu.edu/etd/3617.
Повний текст джерелаSinkovic, John Henry. "The Minimum Rank Problem for Outerplanar Graphs." BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/3722.
Повний текст джерелаHassan-Shafique, Khurram. "PARTITIONING A GRAPH IN ALLIANCES AND ITS APPLICATION TO DATA CLUSTERING." Doctoral diss., University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4152.
Повний текст джерелаPh.D.
School of Computer Science
Engineering and Computer Science
Computer Science
Cornet, Alexis. "Algorithmes et résultats de complexité pour des problèmes de graphes avec contraintes additionnelles." Thesis, Université Clermont Auvergne (2017-2020), 2018. http://www.theses.fr/2018CLFAC034/document.
Повний текст джерелаDomination problems (dominating set, independant dominating set, ...) as well as covering problems (vertex-cover, Steiner tree, ...) are NP-complete. However, for most of these problems, it is always possible to construct a (eventually bad) solution in polynomial time, or at least it is possible to determine whether a solution exists. Those problems originally came from industry, but are simplified modelizations of the real life problems. We add additional constraints modeling plausible practical constraints : conflicts which are pairs of elements that cannot apear simultaneously in a solution (to modelize various incompatibilities), connexity in a second graph (elements of the solution must be able to communicate, and the communication links are a second graph), and obligations which are subsets of interdependant vertices which must be added simultaneously in a solution.We don't aim to model a specific real-world problem, but to study how these plausible constraints affect the complexity of the studied problems. We will see that, in many cases, even determining the existence of a solution (regardless of its size) become hard. The firefighter problem models firefighters aiming to contain a fire spreading turn by turn in a (eventually infinite) graph. We studied this problem with the addition of deplacement constraints for the firefighters (a limited moving speed between turns). We will see that, most of the time, this constraint increase the number of firefighters necessary to contain the fire, but does not trigger such major change as constraints studied in the others problems
Oosthuizen, Joubert. "Random walks on graphs." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86244.
Повний текст джерелаENGLISH ABSTRACT: We study random walks on nite graphs. The reader is introduced to general Markov chains before we move on more specifically to random walks on graphs. A random walk on a graph is just a Markov chain that is time-reversible. The main parameters we study are the hitting time, commute time and cover time. We nd novel formulas for the cover time of the subdivided star graph and broom graph before looking at the trees with extremal cover times. Lastly we look at a connection between random walks on graphs and electrical networks, where the hitting time between two vertices of a graph is expressed in terms of a weighted sum of e ective resistances. This expression in turn proves useful when we study the cover cost, a parameter related to the cover time.
AFRIKAANSE OPSOMMING: Ons bestudeer toevallige wandelings op eindige gra eke in hierdie tesis. Eers word algemene Markov kettings beskou voordat ons meer spesi ek aanbeweeg na toevallige wandelings op gra eke. 'n Toevallige wandeling is net 'n Markov ketting wat tyd herleibaar is. Die hoof paramaters wat ons bestudeer is die treftyd, pendeltyd en dektyd. Ons vind oorspronklike formules vir die dektyd van die verdeelde stergra ek sowel as die besemgra ek en kyk daarna na die twee bome met uiterste dektye. Laastens kyk ons na 'n verband tussen toevallige wandelings op gra eke en elektriese netwerke, waar die treftyd tussen twee punte op 'n gra ek uitgedruk word in terme van 'n geweegde som van e ektiewe weerstande. Hierdie uitdrukking is op sy beurt weer nuttig wanneer ons die dekkoste bestudeer, waar die dekkoste 'n paramater is wat verwant is aan die dektyd.
Camby, Eglantine. "Connecting hitting sets and hitting paths in graphs." Doctoral thesis, Universite Libre de Bruxelles, 2015. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209048.
Повний текст джерелаTout d’abord, nous considérons les deux problèmes suivants :le problème de vertex cover et celui de dominating set, deux cas particuliers du problème de hitting set. Un vertex cover est un ensemble de sommets qui rencontrent toutes les arêtes alors qu’un dominating set est un ensemble X de sommets tel que chaque sommet n’appartenant pas à X est adjacent à un sommet de X. La version connexe de ces problèmes demande que les sommets choisis forment un sous-graphe connexe. Pour les deux problèmes précédents, nous examinons le prix de la connexité, défini comme étant le rapport entre la taille minimum d’un ensemble répondant à la version connexe du problème et celle d’un ensemble du problème originel. Nous prouvons la difficulté du calcul du prix de la connexité d’un graphe. Cependant, lorsqu’on exige que le prix de la connexité d’un graphe ainsi que de tous ses sous-graphes induits soit borné par une constante fixée, la situation change complètement. En effet, pour les problèmes de vertex cover et de dominating set, nous avons pu caractériser ces classes de graphes pour de petites constantes.
Ensuite, nous caractérisons en termes de dominating sets connexes les graphes Pk- free, graphes n’ayant pas de sous-graphes induits isomorphes à un chemin sur k sommets. Beaucoup de problèmes sur les graphes sont étudiés lorsqu’ils sont restreints à cette classe de graphes. De plus, nous appliquons cette caractérisation à la 2-coloration dans les hypergraphes. Pour certains hypergraphes, nous prouvons que ce problème peut être résolu en temps polynomial.
Finalement, nous travaillons sur le problème de Pk-hitting set. Un Pk-hitting set est un ensemble de sommets qui rencontrent tous les chemins sur k sommets. Nous développons un algorithme d’approximation avec un facteur de performance de 3. Notre algorithme, basé sur la méthode primal-dual, fournit un Pk-hitting set dont la taille est au plus 3 fois la taille minimum d’un Pk-hitting set.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
Levy, Eythan. "Approximation algorithms for covering problems in dense graphs." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210359.
Повний текст джерелаFinally, we look at the CONNECTED VERTEX COVER (CVC) problem,for which we proposed new approximation results in dense graphs. We first analyze Carla Savage's algorithm, then a new variant of the Karpinski-Zelikovsky algorithm. Our results show that these algorithms provide the same approximation ratios for CVC as the maximal matching heuristic and the Karpinski-Zelikovsky algorithm did for VC. We provide tight examples for the ratios guaranteed by both algorithms. We also introduce a new invariant, the "price of connectivity of VC", defined as the ratio between the optimal solutions of CVC and VC, and showed a nearly tight upper bound on its value as a function of the weak density. Our last chapter discusses software aspects, and presents the use of the GRAPHEDRON software in the framework of approximation algorithms, as well as our contributions to the development of this system.
/
Nous présentons un ensemble de résultats d'approximation pour plusieurs problèmes de couverture dans les graphes denses. Ces résultats montrent que pour plusieurs problèmes, des algorithmes classiques à facteur d'approximation constant peuvent être analysés de manière plus fine, et garantissent de meilleurs facteurs d'aproximation constants sous certaines contraintes de densité. Nous montrons en particulier que l'heuristique du matching maximal approxime les problèmes VERTEX COVER (VC) et MINIMUM MAXIMAL MATCHING (MMM) avec un facteur constant inférieur à 2 quand la proportion d'arêtes présentes dans le graphe (densité faible) est supérieure à 3/4 ou quand le degré minimum normalisé (densité forte) est supérieur à 1/2. Nous montrons également que ce résultat peut être amélioré par un algorithme de type GREEDY, qui fournit un facteur constant inférieur à 2 pour des densités faibles supérieures à 1/2. Nous donnons également des familles de graphes extrémaux pour nos facteurs d'approximation. Nous nous somme ensuite intéressés à plusieurs algorithmes de la littérature pour les problèmes VC et SET COVER (SC). Nous avons présenté une approche unifiée et critique des algorithmes de Karpinski-Zelikovsky, Imamura-Iwama, et Bar-Yehuda-Kehat, identifiant un schéma général dans lequel s'intègrent ces algorithmes.
Nous nous sommes finalement intéressés au problème CONNECTED VERTEX COVER (CVC), pour lequel nous avons proposé de nouveaux résultats d'approximation dans les graphes denses, au travers de l'algorithme de Carla Savage d'une part, et d'une nouvelle variante de l'algorithme de Karpinski-Zelikovsky d'autre part. Ces résultats montrent que nous pouvons obtenir pour CVC les mêmes facteurs d'approximation que ceux obtenus pour VC à l'aide de l'heuristique du matching maximal et de l'algorithme de Karpinski-Zelikovsky. Nous montrons également des familles de graphes extrémaux pour les ratios garantis par ces deux algorithmes. Nous avons également étudié un nouvel invariant, le coût de connectivité de VC, défini comme le rapport entre les solutions optimales de CVC et de VC, et montré une borne supérieure sur sa valeur en fonction de la densité faible. Notre dernier chapitre discute d'aspects logiciels, et présente l'utilisation du logiciel GRAPHEDRON dans le cadre des algorithmes d'approximation, ainsi que nos contributions au développement du logiciel.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
Книги з теми "Cover graph"
NoteBooks, Sappuris. Graph Paper, Magenta Cover. Independently Published, 2021.
Знайти повний текст джерелаPress, Mockup. Graph Notebook: Hardcover Graph Notebook with Retro Style Cover. Independently Published, 2021.
Знайти повний текст джерелаPublishing, Karabella. Graph Paper: 5x5 Blank Graph Paper with Angel on Cover. Independently Published, 2018.
Знайти повний текст джерелаMagic, Handwriter. Graph Paper Notebook: Beautiful Soft Cover. Independently Published, 2020.
Знайти повний текст джерелаNoteBooks, Sappuris. Graph Paper Abstract Halftone Background Cover. Independently Published, 2021.
Знайти повний текст джерелаSunny Days Sunny Days School Room. Graph Paper Notepad: 5x5 Graph Ruled Squared Graphing Paper with Coordinate Graph Point Cover. Independently Published, 2019.
Знайти повний текст джерелаbooks, touchich. Graph Paper Composition 5x5: Size 6*9,120 Graph Pages ,matte Cover. Independently Published, 2020.
Знайти повний текст джерелаЧастини книг з теми "Cover graph"
Atienza, Nieves, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, et al. "Cover Contact Graphs." In Graph Drawing, 171–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-77537-9_18.
Повний текст джерелаAngel, Eric, Evripidis Bampis, Bruno Escoffier, and Michael Lampis. "Parameterized Power Vertex Cover." In Graph-Theoretic Concepts in Computer Science, 97–108. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53536-3_9.
Повний текст джерелаFomin, Fedor V., and Torstein J. F. Strømme. "Vertex Cover Structural Parameterization Revisited." In Graph-Theoretic Concepts in Computer Science, 171–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53536-3_15.
Повний текст джерелаKourie, Derrick G., and Bruce W. Watson. "Case Study: Lattice Cover Graph Construction." In The Correctness-by-Construction Approach to Programming, 197–226. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27919-5_6.
Повний текст джерелаIvković, Zoran, and Errol L. Lloyd. "Fully dynamic maintenance of vertex cover." In Graph-Theoretic Concepts in Computer Science, 99–111. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57899-4_44.
Повний текст джерелаWang, Liang, and Jianxin Zhao. "Computation Graph." In Architecture of Advanced Numerical Analysis Systems, 149–89. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8853-5_6.
Повний текст джерелаKneis, Joachim, Alexander Langer, and Peter Rossmanith. "Improved Upper Bounds for Partial Vertex Cover." In Graph-Theoretic Concepts in Computer Science, 240–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92248-3_22.
Повний текст джерелаChen, Jianer, Iyad A. Kanj, and Weijia Jia. "Vertex Cover: Further Observations and Further Improvements." In Graph-Theoretic Concepts in Computer Science, 313–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46784-x_30.
Повний текст джерелаKılıç, Baran, Can Özturan, and Alper Şen. "Analyzing Large-Scale Blockchain Transaction Graphs for Fraudulent Activities." In Big Data and Artificial Intelligence in Digital Finance, 253–67. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-94590-9_14.
Повний текст джерелаFellows, Michael R., Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, and Saket Saurabh. "Graph Layout Problems Parameterized by Vertex Cover." In Algorithms and Computation, 294–305. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92182-0_28.
Повний текст джерелаТези доповідей конференцій з теми "Cover graph"
Guan, Renxiang, Zihao Li, Chujia Song, Guo Yu, Xianju Li, and Ruyi Feng. "S2RC-GCN: A Spatial-Spectral Reliable Contrastive Graph Convolutional Network for Complex Land Cover Classification Using Hyperspectral Images." In 2024 International Joint Conference on Neural Networks (IJCNN), 1–8. IEEE, 2024. http://dx.doi.org/10.1109/ijcnn60899.2024.10650629.
Повний текст джерелаKrishnan, Sivaram, Jihong Park, Gregory Sherman, Benjamin Campbell, and Jinho Choi. "Graph Koopman Autoencoder for Predictive Covert Communication Against UAV Surveillance." In 2024 IEEE 99th Vehicular Technology Conference (VTC2024-Spring), 1–5. IEEE, 2024. http://dx.doi.org/10.1109/vtc2024-spring62846.2024.10683140.
Повний текст джерелаStephans, Larry C. "The Design of Masonry/Plastic Lining Composite Structures." In CORROSION 1997, 1–8. NACE International, 1997. https://doi.org/10.5006/c1997-97363.
Повний текст джерелаWerner, Peter, Alexandre Amice, Tobia Marcucci, Daniela Rus, and Russ Tedrake. "Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs." In 2024 IEEE International Conference on Robotics and Automation (ICRA), 10359–65. IEEE, 2024. http://dx.doi.org/10.1109/icra57147.2024.10610005.
Повний текст джерелаGusev, Vasily Vasilievich. "Game of vertex cover of a graph." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-56.
Повний текст джерелаMariano, Matheus Monteiro, Érica Ferreira Souza, André Takeshi Endo, and Nandamudi L. Vijaykumar. "A comparative study of algorithms for generating switch cover test sets." In XV Simpósio Brasileiro de Qualidade de Software. Sociedade Brasileira de Computação - SBC, 2016. http://dx.doi.org/10.5753/sbqs.2016.15122.
Повний текст джерелаBotler, Fábio, and Luiz Hoffmann. "Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11078.
Повний текст джерелаGangatharan, Venkat Narayanan, Suresh Suseela, and Kala Rukhmoni. "On 2−simple graphoidal cover of a graph." In 1ST INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2020. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0025497.
Повний текст джерелаDivsalar, Dariush, and Lara Dolecek. "Graph cover ensembles of non-binary protograph LDPC codes." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283972.
Повний текст джерелаSkachek, Vitaly. "Characterization of graph-cover pseudocodewords of codes over F3." In 2010 IEEE Information Theory Workshop (ITW 2010). IEEE, 2010. http://dx.doi.org/10.1109/cig.2010.5592884.
Повний текст джерелаЗвіти організацій з теми "Cover graph"
Lundgren, J. R., and John S. Maybee. Graphs and Matrices: Combinatorial Analysis, Competitions, Covers and Ranks. Fort Belvoir, VA: Defense Technical Information Center, September 1993. http://dx.doi.org/10.21236/ada280480.
Повний текст джерелаRosenblatt, David, Henry Mooney, Khamal Clayton, Cloe Ortiz de Mendívil, Ariel McCaskie, Victor Gauto, Monique Graham, Jeetendra Khadan, and Nirvana Satnarine-Singh. Open configuration options Caribbean Economics Quarterly: Volume 11: Issue 1, February 2022: Year in Review in Graphs: Economic Story of 2021 in a Series of Graphs. Inter-American Development Bank, February 2022. http://dx.doi.org/10.18235/0004018.
Повний текст джерелаNieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 18. Hilbert Press, 2018. http://dx.doi.org/10.56441/hilbertpress.1818.9585.
Повний текст джерелаNieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 20. Hilbert Press, 2020. http://dx.doi.org/10.56441/hilbertpress.2048.3738.
Повний текст джерелаNieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 19. Hilbert Press, 2019. http://dx.doi.org/10.56441/hilbertpress.1927.9364.
Повний текст джерелаTurgeon, Mathieu. Causal Modeling with Regression Discontinuity Designs (RDD). Instats Inc., 2023. http://dx.doi.org/10.61700/s3nl5lfnmruqw469.
Повний текст джерелаTurgeon, Mathieu. Causal Modeling with Regression Discontinuity Designs (RDD). Instats Inc., 2023. http://dx.doi.org/10.61700/o6e22r1sh4h7m469.
Повний текст джерелаHeitman, Joshua L., Alon Ben-Gal, Thomas J. Sauer, Nurit Agam, and John Havlin. Separating Components of Evapotranspiration to Improve Efficiency in Vineyard Water Management. United States Department of Agriculture, March 2014. http://dx.doi.org/10.32747/2014.7594386.bard.
Повний текст джерелаSprague, Joshua, David Kushner, James Grunden, Jamie McClain, Benjamin Grime, and Cullen Molitor. Channel Islands National Park Kelp Forest Monitoring Program: Annual report 2014. National Park Service, August 2022. http://dx.doi.org/10.36967/2293855.
Повний текст джерелаSaltus, Christina, Molly Reif, and Richard Johansen. waterquality for ArcGIS Pro Toolbox. Engineer Research and Development Center (U.S.), October 2021. http://dx.doi.org/10.21079/11681/42240.
Повний текст джерела