Relevant bibliographies by topics / Grid graphs

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Grid graphs'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Grid graphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Grid graphs"

1

FÜRER, MARTIN, and SHIVA PRASAD KASIVISWANATHAN. "Approximately Counting Embeddings into Random Graphs." Combinatorics, Probability and Computing 23, no. 6 (2014): 1028–56. http://dx.doi.org/10.1017/s0963548314000339.

Full text
Abstract:
LetHbe a graph, and letCH(G) be the number of (subgraph isomorphic) copies ofHcontained in a graphG. We investigate the fundamental problem of estimatingCH(G). Previous results cover only a few specific instances of this general problem, for example the case whenHhas degree at most one (the monomer-dimer problem). In this paper we present the first general subcase of the subgraph isomorphism counting problem, which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labelling of the vertices such that every edge
APA, Harvard, Vancouver, ISO, and other styles
2

Uras, Tansel, and Sven Koenig. "Speeding-Up Any-Angle Path-Planning on Grids." Proceedings of the International Conference on Automated Planning and Scheduling 25 (April 8, 2015): 234–38. http://dx.doi.org/10.1609/icaps.v25i1.13724.

Full text
Abstract:
Simple Subgoal Graphs are constructed from grids by placing subgoals at the corners of obstacles and connecting them. They are analogous to visibility graphs for continuous terrain but have fewer edges and can be used to quickly find shortest paths on grids. The vertices of a Simple Subgoal Graph can be partitioned into different levels to create N-Level Subgoal Graphs, which can be used to find shortest paths on grids even more quickly by ignoring subgoals that are not relevant for the search, which significantly reduces the size of the graph being searched. Search using Two-Level Subgoal Gra
APA, Harvard, Vancouver, ISO, and other styles
3

Klavžar, Sandi, and Riste Škrekovski. "On median graphs and median grid graphs." Discrete Mathematics 219, no. 1-3 (2000): 287–93. http://dx.doi.org/10.1016/s0012-365x(00)00085-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hartman, I. Ben-Arroyo, Ilan Newman, and Ran Ziv. "On grid intersection graphs." Discrete Mathematics 87, no. 1 (1991): 41–52. http://dx.doi.org/10.1016/0012-365x(91)90069-e.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Burosch, Gustav, and Jean-Marie Laborde. "Characterization of grid graphs." Discrete Mathematics 87, no. 1 (1991): 85–88. http://dx.doi.org/10.1016/0012-365x(91)90074-c.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cyman, Joanna, and Joanna Raczek. "Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids." Energies 15, no. 9 (2022): 2969. http://dx.doi.org/10.3390/en15092969.

Full text
Abstract:
Smart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost. In this paper, we study a two-dimensional rectangular grid graph which is considered to be a model of a smart grid; nodes of the graph represent points and devices of
APA, Harvard, Vancouver, ISO, and other styles
7

Storandt, Sabine. "The Hierarchy in Grid Graphs (Extended Abstract)." Proceedings of the International Symposium on Combinatorial Search 4, no. 1 (2021): 209–10. http://dx.doi.org/10.1609/socs.v4i1.18301.

Full text
Abstract:
Many speed-up techniques developed for accelerating the computation of shortest paths in road networks, like reach or contraction hierarchies, are based on the property that some streets are ’more important’ than others, e.g. on long routes the usage of an interstate is almost inevitable. In grids there is no obvious hierarchy among the edges, especially if the costs are uniform. Nevertheless we will show that contraction hierarchies can be applied to grid graphs as well. We will point out interesting connections to speed-up techniques shaped for routing on grids, like swamp hierarchies and ju
APA, Harvard, Vancouver, ISO, and other styles
8

Zamfirescu, Christina, and Tudor Zamfirescu. "Hamiltonicity of Topological Grid Graphs." JUCS - Journal of Universal Computer Science 13, no. (11) (2007): 1791–800. https://doi.org/10.3217/jucs-013-11-1791.

Full text
Abstract:
In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of the usual square lattice graph of the plane. The main results are as follows. The shortness coefficient of the family of all topological grid graphs is at most 16/17. Every 3-connected topological grid graph is hamiltonian.
APA, Harvard, Vancouver, ISO, and other styles
9

Uras, Tansel, and Sven Koenig. "Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs." Proceedings of the International Symposium on Combinatorial Search 9, no. 1 (2021): 106–14. http://dx.doi.org/10.1609/socs.v9i1.18446.

Full text
Abstract:
Subgoal graphs can be constructed on top of graphs during a preprocessing phase to speed-up shortest path queries. They have an undominated query-time/memory trade-off in the Grid-Based Path Planning Competitions. While grids are useful for path planning, other kinds of graphs, such as state lattices, have to be used for motion planning. While state lattices are regular graphs like grids, subgoal graphs improve query times by a much smaller factor on state lattices than on grids. In this paper, we present a new version of subgoal graphs that forfeits its optimality guarantee for smaller query
APA, Harvard, Vancouver, ISO, and other styles
10

MIURA, KAZUYUKI, SHIN-ICHI NAKANO, and TAKAO NISHIZEKI. "CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS." International Journal of Foundations of Computer Science 17, no. 05 (2006): 1031–60. http://dx.doi.org/10.1142/s012905410600425x.

Full text
Abstract:
A convex grid drawing of a plane graph G is a drawing of G on the plane such that all vertices of G are put on grid points, all edges are drawn as straight-line segments without any edge-intersection, and every face boundary is a convex polygon. In this paper we give a linear-time algorithm for finding a convex grid drawing of every 4-connected plane graph G with four or more vertices on the outer face. The size of the drawing satisfies W + H ≤ n - 1, where n is the number of vertices of G, W is the width and H is the height of the grid drawing. Thus the area W · H is at most ⌈(n - 1)/2⌉ · ⌊(n
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Grid graphs"

1

Wojciechowska, Iwona. "Broadcasting in grid graphs." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=877.

Full text
Abstract:
Thesis (Ph. D.)--West Virginia University, 1999.<br>Title from document title page. Document formatted into pages; contains vii, 69 p. : ill. Includes abstract. Includes bibliographical references (p. 67-69).
APA, Harvard, Vancouver, ISO, and other styles
2

Rocha, Mário. "The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth." CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2311.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Proffitt, Kenneth Eugene. "Paired-domination in grid graphs." [Johnson City, Tenn. : East Tennessee State University], 2001. http://etd-submit.etsu.edu/etd/theses/available/etd-0213101-214504/restricted/proffittk.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sterling, Christopher Kent. "Liar's Domination in Grid Graphs." Digital Commons @ East Tennessee State University, 2012. https://dc.etsu.edu/etd/1415.

Full text
Abstract:
As introduced by Slater in 2008, liar's domination provides a way of modeling protection devices where one may be faulty. Assume each vertex of a graph G is the possible location for an intruder such as a thief. A protection device at a vertex v is assumed to be able to detect the intruder at any vertex in its closed neighborhood N[v] and identify at which vertex in N[v] the intruder is located. A dominating set is required to identify any intruder's location in the graph G, and if any one device can fail to detect the intruder, then a double-dominating set is necessary. Stronger still, a liar
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Jiaxin. "Various pushing methods on grid graphs." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=839.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 1999.<br>Title from document title page. Document formatted into pages; contains v, 39 p. : ill. (some col.) Includes abstract. Includes bibliographical references (p. 39).
APA, Harvard, Vancouver, ISO, and other styles
6

Curro', Vincenzo. "The Roman Domination Problem on Grid Graphs." Doctoral thesis, Università di Catania, 2014. http://hdl.handle.net/10761/1561.

Full text
Abstract:
Domination is a rapidly developing area of research in graph theory. This dissertation focuses on the Roman Domination Problem; it was introduced quite recently and has some interesting applications in real world problems such military strategies and wireless networking. Given a graph, a Roman Dominating Function is a function that labels the vertices of the graph with an integer between 0, 1, 2, satisfying the condition that every vertex labeled by 0 is adjacent to at least one vertex labeled by 2. The weight of a Roman Dominating Function is the sum of all the labels, and the minimum weig
APA, Harvard, Vancouver, ISO, and other styles
7

Ho, Yiu Yu. "Global secure sets of trees and grid-like graphs." Doctoral diss., University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4922.

Full text
Abstract:
However, as will be demonstrated in Chapter 1, a defensive alliance may not be able to properly defend itself when multiple members are under attack at the same time. The concept of secure sets is introduced in (BDH07) for exactly this purpose. The non-empty set S is a secure set if every subset Xsubset of]S, with the assistance of vertices in S, can successfully defend against simultaneous attacks coming from vertices outside of S. The exact definition of simultaneous attacks and how such attacks may be defended will be provided in Chapter 1. In (BDH07), the authors presented an interesting c
APA, Harvard, Vancouver, ISO, and other styles
8

Rudoy, Mikhail. "Hamiltonian cycle and related problems : vertex-breaking, grid graphs, and Rubik's Cubes." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113112.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 123-124).<br>In this thesis, we analyze the computational complexity of several problems related to the Hamiltonian Cycle problem. We begin by introducing a new problem, which we call Tree-Residue Vertex-Breaking (TRVB). Giv
APA, Harvard, Vancouver, ISO, and other styles
9

Mustata, Irina [Verfasser], Stefan [Akademischer Betreuer] Felsner, and Ekkehard [Akademischer Betreuer] Köhler. "On subclasses of grid intersection graphs / Irina Mustata. Gutachter: Ekkehard Köhler. Betreuer: Stefan Felsner." Berlin : Technische Universität Berlin, 2014. http://d-nb.info/1066550573/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Oprisan, Sorinel. "A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding." ScholarWorks@UNO, 2005. http://scholarworks.uno.edu/td/238.

Full text
Abstract:
We used a divide-and-conquer algorithm to recursively solve the two-dimensional problem of protein folding of an HP sequence with the maximum number of H-H contacts. We derived both lower and upper bounds for the algorithmic complexity by using the newly introduced concept of multi-directional width-bounded geometric separator. We proved that for a grid graph G with n grid points P, there exists a balanced separator A subseteq P$ such that A has less than or equal to 1.02074 sqrt{n} points, and G-A has two disconnected subgraphs with less than or equal to {2over 3}n nodes on each subg
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Grid graphs"

1

K, Choo Yung, Eiseman Peter R, Reno Charles J, and Lewis Research Center, eds. Interactive grid generation for turbomachinery flow field simulations. National Aeronautics and Space Administration, Lewis Research Center, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

World, Korey's. Dot Grid Notebook: 6x9 Journal with Dot Grid for Lists, Drawing, Making Graphs and More. Lulu Press, Inc., 2022.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

One, Red. Graph Paper Notebook : Squared Exercise Book A4: Squared Quad Ruled Grid Paper Notebook for Mathematics , Science, Make Graphs, Drawing. . . Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

One, Red. Graph Paper Notebook : Squared Exercise Book A4: Squared Quad Ruled Grid Paper Notebook for Mathematics , Science, Make Graphs, Drawing. . . Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Stationery, Spring Hill. Composition Book - Isometric Grid: 1/4 in Equilateral Triangle for 3D Drawings and Tech Graphs & Printing. Independently Published, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Books, Game. RPG Pages Bumper Book; Grid Squares Hex Graphs Etc: Full Pack 250 A4 Pages Different Styles. Independently Published, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Publisher, Bklx. Dot Grid Notebook: Dotted Grid Journal Notebook for Kids, Adults, Girls, Boys, Large Dotted Pages Journal, Bullet Journal, Artsy Lettering, Dot Graphs Paper, Dot Graph Paper Notebook, Notebook for Drawing, Writing, Sketching for Adults and Kids 120 Pages. Independently Published, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Press, John. Pixel Grid Graph Paper: 100 Sheets Graph Paper Pixel Grids. Independently Published, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Coolen, A. C. C., A. Annibale, and E. S. Roberts. Applications of random graphs. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0011.

Full text
Abstract:
This chapter reviews graph generation techniques in the context of applications. The first case study is power grids, where proposed strategies to prevent blackouts have been tested on tailored random graphs. The second case study is in social networks. Applications of random graphs to social networks are extremely wide ranging – the particular aspect looked at here is modelling the spread of disease on a social network – and how a particular construction based on projecting from a bipartite graph successfully captures some of the clustering observed in real social networks. The third case stu
APA, Harvard, Vancouver, ISO, and other styles
10

Publishing, GriddddART. Notebook: 252 Pages, Size 8. 5 X 11 , White Paper with 0. 25 Graphs, Journal, Sketchbook, Cover with Colorful Geometric Grid-Art. Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Grid graphs"

1

Storandt, Sabine. "Contraction Hierarchies on Grid Graphs." In KI 2013: Advances in Artificial Intelligence. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40942-4_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gorbenko, Anna, Vladimir Popov, and Andrey Sheka. "Localization on Discrete Grid Graphs." In Lecture Notes in Electrical Engineering. Springer Netherlands, 2011. http://dx.doi.org/10.1007/978-94-007-1839-5_105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cáceres, José, Carmen Cortés, Clara Isabel Grima, et al. "Compact Grid Representation of Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34191-5_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cheng, Siu-Wing. "Exact Steiner Trees in Graphs and Grid Graphs." In Advances in Steiner Trees. Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3171-2_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pach, János, Torsten Thiele, and Géza Tóth. "Three-dimensional grid drawings of graphs." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63938-1_49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hossain, Md Iqbal, and Md Saidur Rahman. "Monotone Grid Drawings of Planar Graphs." In Frontiers in Algorithmics. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08016-1_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rahman, Saidur, Shin-ichi Nakano, and Takao Nishizeki. "Rectangular grid drawings of plane graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61332-3_142.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Eades, Peter, and Qing-Wen Feng. "Drawing clustered graphs on an orthogonal grid." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63938-1_58.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

He, Xin. "Grid embedding of 4-connected plane graphs." In Graph Drawing. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0021812.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Miura, Kazuyuki, Shin-ichi Nakano, and Takao Nishizeki. "Grid Drawings of Four-Connected Plane Graphs." In Graph Drawing. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46648-7_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Grid graphs"

1

Li, Jiannan, Kun Song, Shuangying Zhang, et al. "Research on Knowledge Management System for the Early Stages of Power Grid Projects Based on Knowledge Graphs and GPT Technology." In 2025 IEEE International Conference on Electronics, Energy Systems and Power Engineering (EESPE). IEEE, 2025. https://doi.org/10.1109/eespe63401.2025.10987001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Indunil, W. K. M., та A. A. I. Perera. "𝒌 – Graceful Labeling of Triangular Type Grid Graphs 𝑫𝒏(𝑷𝒎) and 𝑳 – Vertex Union of 𝑫𝒏(𝑷𝒎)". У SLIIT 2nd International Conference on Engineering and Technology. SLIIT, 2023. http://dx.doi.org/10.54389/ilio4846.

Full text
Abstract:
Graph labeling is one of the most popular research topics in the field of graph theory. Prime labeling, antimagic labeling, radio labeling, graceful labeling, lucky labeling, and incidence labeling are some of the labeling techniques. Among the above-mentioned techniques, graceful labeling is one of the most engaging graph labeling techniques with a vast amount of real-world applications. Over the past few decades, plenty of studies have been conducted on this area in various dimensions. Grid graphs are very much useful in applications of circuit theory, communication networks, and transportat
APA, Harvard, Vancouver, ISO, and other styles
3

Santos, Tanilson D., Jayme Szwarcfiter, Uéverton S. Souza, and Claudson F. Bornstein. "On the Helly Property of Some Intersection Graphs." In Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação, 2021. http://dx.doi.org/10.5753/ctd.2021.15752.

Full text
Abstract:
An EPG graph G is an edge-intersection graph of paths on a grid. In this thesis, we analyze structural characterizations and complexity aspects regarding EPG graphs. Our main focus is on the class of B1-EPG graphs whose intersection model satisfies well-known the Helly property, called Helly-B1-EPG. We show that the problem of recognizing Helly-B1-EPG graphs is NP-complete. Besides, other intersection graph classes such as VPG, EPT, and VPT were also studied. We completely solve the problem of determining the Helly and strong Helly numbers of Bk-EPG graphs and Bk-VPG graphs for each non-negati
APA, Harvard, Vancouver, ISO, and other styles
4

Sudakov, V., and N. Yashin. "IMPLEMENTING THE GRAPH MODEL OF THE SPREAD OF A PANDEMIC ON GPUS." In 9th International Conference "Distributed Computing and Grid Technologies in Science and Education". Crossref, 2021. http://dx.doi.org/10.54546/mlit.2021.53.71.001.

Full text
Abstract:
Modeling the spread of viruses is an urgent task in modern conditions. In the created model, contactsbetween people are represented in the form of the Watz and Strogatz graph. We studied graphs withtens of thousands of vertices with a simulation period of six months. The paper proposes methods foraccelerating computations on graph models using graphics processors. In the considered problem,there were two resource-intensive computational tasks: generating an adjacency matrix of a graph thatsimulates the presence of contacts between people and traversing this graph in order to simulateinfection.
APA, Harvard, Vancouver, ISO, and other styles
5

Uras, Tansel, and Sven Koenig. "Understanding Subgoal Graphs by Augmenting Contraction Hierarchies." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/209.

Full text
Abstract:
Contraction hierarchies and (N-level) subgoal graphs are two preprocessing-based path-planning algorithms that have so far only been compared experimentally through the grid-based path-planning competitions, where both algorithms had undominated runtime/memory trade-offs. Subgoal graphs can be considered as a framework that can be customized to different domains through the choice of a reachability relation R that identifies pairs of nodes on a graph between which it is easy to find shortest paths. Subgoal graphs can exploit R in various ways to speed-up query times and reduce memory requireme
APA, Harvard, Vancouver, ISO, and other styles
6

Luca, Vitor T. F. de, María Pía Mazzoleni, Fabiano S. Oliveira, and Jayme L. Szwarcfiter. "Edge Intersection Graphs of Paths on a Triangular Grid." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.222476.

Full text
Abstract:
We introduce a new class of intersection graphs, the edge intersection graphs of paths on a triangular grid, called EPGt graphs. We compare this new class with the well-known class of EPG graphs. A turn of a path at a grid point is called a bend. An EPGt representation in which every path has at most k bends is called a Bk-EPGt representation and the corresponding graphs are called Bk-EPGt graphs. We characterize the representation of cliques with three vertices and chordless 4-cycles in B1-EPGt representations.
APA, Harvard, Vancouver, ISO, and other styles
7

Bulbul, Erhan, and Aydin Cetin. "Optimization of Grid-Graphs using Segmentation." In 2017 International Artificial Intelligence and Data Processing Symposium (IDAP). IEEE, 2017. http://dx.doi.org/10.1109/idap.2017.8090173.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Demange, Marc, and Dominique De Werra. "(p,q) - Choosability of Grid Graphs." In Annual International Conference on Computational Mathematics, Computational Geometry & Statistics. Global Science and Technology Forum (GSTF), 2012. http://dx.doi.org/10.5176/2251-1911_cmcgs57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shalalfeh, Laith, Paul Bogdan, and Edmond Jonckheere. "PMU Visibility Graphs." In 2020 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT). IEEE, 2020. http://dx.doi.org/10.1109/isgt45199.2020.9087753.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rappoport, A., and I. Kurochkin. "THE GRAPH DIAMETER OF A DISTRIBUTED SYSTEM WITH A GIVEN DOMINANT SET." In 9th International Conference "Distributed Computing and Grid Technologies in Science and Education". Crossref, 2021. http://dx.doi.org/10.54546/mlit.2021.63.14.001.

Full text
Abstract:
In this work consider a distributed computing system in which the control functions are dispersed inseveral dominant nodes that are directly connected to all the others. This configuration reduces thevulnerability of the entire network, since the failure of a single control element immediately disruptsits operation. On the other hand, the large length of the maximum shortest chain (diameter) increasesthe data transfer time, which is bad for the functioning of the entire system. The connection of themaximum shortest chain of a distributed network graph with the size of a certain dominant set is
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Grid graphs"

1

Beck, D. M., M. J. Scott, S. F. Shindle, et al. Hanford Area 1990 population and 50-year projections. [Appendix contains computer programming for population projections and graphs showing them by grid areas]. Office of Scientific and Technical Information (OSTI), 1991. http://dx.doi.org/10.2172/5070450.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ponce, Colin, and Panayot S. Vassilevski. Solving Graph Laplacian Systems Through Recursive Bisections and Two-Grid Preconditioning. Office of Scientific and Technical Information (OSTI), 2016. http://dx.doi.org/10.2172/1240975.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Reisch, Bruce, Pinhas Spiegel-Roy, Norman Weeden, Gozal Ben-Hayyim, and Jacques Beckmann. Genetic Analysis in vitis Using Molecular Markers. United States Department of Agriculture, 1995. http://dx.doi.org/10.32747/1995.7613014.bard.

Full text
Abstract:
Genetic analysis and mapping in grapes has been difficult because of the long generation period and paucity of genetic markers. In the present work, chromosome linkage maps were developed with RAPD, RFLP and isozyme loci in interspecific hybrid cultivars, and RAPD markers were produced in a V. vinifera population. In three cultivars, there were 19 linkage groups as expected for a species with 38 somatic chromosomes. These maps were used to locate chromosome regions with linkages to important genes, including those influencing powdery mildew and botrytis bunch rot resistance; flower sex; and be
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Wenting. Robust Fault Location in Power Grids through Graph Learning at Low Label Rates. Office of Scientific and Technical Information (OSTI), 2021. http://dx.doi.org/10.2172/1768426.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Emsley, Howard T. I3G VIRGO Interactive Graphics for Geometry Generation and Visual Interactive Rapid Grid Generation. User's Manual. Defense Technical Information Center, 1990. http://dx.doi.org/10.21236/ada226117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Margolis, Rachel. La santé des grands-parents et le bien-être de la famille. L’Institut Vanier de la famille, 2017. http://dx.doi.org/10.61959/qvjz2285f.

Full text
Abstract:
Au Canada, quelque 7,1 millions de grands-parents et d’arrière-grands-parents procurent un apport unique, diversifié et précieux aux familles et à la société, entre autres par leur mentorat, leur rôle d’éducateurs et leur savoir-faire, ou en tant que dépositaires de la mémoire familiale. À l’instar de la population canadienne, le groupe démographique des grands-parents connaît un vieillissement rapide qui suscite certaines préoccupations dans les médias et l’opinion publique quant à l’impact éventuel de ce « tsunami gris ». Toutefois, même s’il gagne en âge, le groupe des grands-parents serait
APA, Harvard, Vancouver, ISO, and other styles
7

Shiltsev, Vladimir. Electron Multi-Beams (Electron Grids, Electron Lattices and Electron Grates): New Elements for Accelerators. Office of Scientific and Technical Information (OSTI), 2018. http://dx.doi.org/10.2172/1464935.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Emsley, Howard T. I3G VIRGO The Interactive Graphics for Geometry Generation Program and the Visual Interactive Rapid Grid Generation Program (User's Manual). Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada238837.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Honghai, Mitchell Brown, Lihwa Lin, et al. Coastal Modeling System user's manual. Engineer Research and Development Center (U.S.), 2024. http://dx.doi.org/10.21079/11681/48392.

Full text
Abstract:
The Coastal Modeling System (CMS) is a suite of coupled 2D numerical models for simulating nearshore waves, currents, water levels, sediment transport, morphology change, and salinity and temperature. Developed by the Coastal Inlets Research Program of the US Army Corps of Engineers, the CMS provides coastal engineers and scientists a PC-based, easy-to-use, accurate, and efficient tool for understanding of coastal processes and for designing and managing of coastal inlets research, navigation projects, and sediment exchange between inlets and adjacent beaches. The present technical report acts
APA, Harvard, Vancouver, ISO, and other styles
10

Trepp, Megan, Gail R. Nonnecke, Paul A. Domoto, and Dennis N. Portz. Maturation of Recently Released Cold Hardy Wine Grap Cultivars in Iowa: Corot noir, Frontenac Gris, La Crescent, Marquette, and Noiret. Iowa State University, Digital Repository, 2009. http://dx.doi.org/10.31274/farmprogressreports-180814-2133.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Grid graphs' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography