Relevant bibliographies by topics / Two-graph

Contents

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

Academic literature on the topic 'Two-graph'

Author: Grafiati
Published: 3 June 2025
Last updated: 22 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 'Two-graph.'

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 "Two-graph"

1

Riera, Constanza, Stéphane Jacob, and Matthew G. Parker. "From graph states to two-graph states." Designs, Codes and Cryptography 48, no. 2 (2008): 179–206. http://dx.doi.org/10.1007/s10623-008-9167-9.

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

Wafiq, Hibi. "Non-Isomorphism Between Graph And Its Complement." Multicultural Education 7, no. 6 (2021): 256. https://doi.org/10.5281/zenodo.4965942.

Full text
Abstract:
<em>It is known that any graph with six vertices cannot be isomorphic to its complement [3].V. K. Balakrishnan has written in his book Schaum&rsquo;s solved problems series [1] the following: &ldquo;Given two arbitrary Simple graphs of the same order and the same size, the problem of determining whetheran isomorphism exists between the two is known as the isomorphism problem in graph theory. In general, itis not all easy (in other words, there is no &quot;efficient algorithm&quot;) to solve an arbitrary instance of the isomorphismproblem&rdquo;, from here came the idea of this paper. As mentioned,isomorphism between two graphs G_1and G_2 is a one-valued function that copies the vertices of graph G_1over all the vertices of graphG_2. If two vertices connected on edge in graphG_1, their imageswill connected on edge in graphG_2;also, if two vertices are not connected in edge on graph G_1 so their images will also not be connected in edge also on graphG_2.The complementary graph of graph G and which will be marked with G ̅, is defined as the graph that contains the same set of vertices, and two vertices connected on edge in graph G will be connected on edge in graph G ̅, and two non-connected vertices on edge in graph G will be non-connected vertices on edge in graphG ̅. The purpose of this paper is to present anenough condition on the vertex number of a given graph so that it is not isomorphic to its complement.</em>
APA, Harvard, Vancouver, ISO, and other styles
3

Harary, Frank, and Zsolt Tuza. "Two graph-colouring games." Bulletin of the Australian Mathematical Society 48, no. 1 (1993): 141–49. http://dx.doi.org/10.1017/s0004972700015549.

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

Ravelo, Jesús N. "Two graph algorithms derived." Acta Informatica 36, no. 6 (1999): 489–510. http://dx.doi.org/10.1007/s002360050182.

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

Onn, Shmuel. "Two graph isomorphism polytopes." Discrete Mathematics 309, no. 9 (2009): 2934–36. http://dx.doi.org/10.1016/j.disc.2008.07.001.

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

Nebeský, Ladislav, and Elena Wisztová. "Two edge-disjoint Hamiltonian cycles of powers of a graph." Časopis pro pěstování matematiky 110, no. 3 (1985): 294–301. http://dx.doi.org/10.21136/cpm.1985.118236.

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

Bacsó, Gabor, Attila Tálos, and Zsolt Tuza. "Graph Domination in Distance Two." Discussiones Mathematicae Graph Theory 25, no. 1-2 (2005): 121. http://dx.doi.org/10.7151/dmgt.1266.

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

Rho, Yoo-Mi. "ON TWO GRAPH PARTITIONING QUESTIONS." Journal of the Korean Mathematical Society 42, no. 4 (2005): 847–56. http://dx.doi.org/10.4134/jkms.2005.42.4.847.

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

Kawarabayashi, Ken-ichi, Michael D. Plummer, and Akira Saito. "On two equimatchable graph classes." Discrete Mathematics 266, no. 1-3 (2003): 263–74. http://dx.doi.org/10.1016/s0012-365x(02)00813-0.

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

Reichenheim, Michael E. "Two-graph Receiver Operating Characteristic." Stata Journal: Promoting communications on statistics and Stata 2, no. 4 (2002): 351–57. http://dx.doi.org/10.1177/1536867x0200200402.

Full text
Abstract:
The command roctg allows visualizing sensitivity (Se)and specificity (Sp) curves according to the range of values of a new diagnostic test, given a “true” state of an event, the reference test. On request, several options for displaying Se and Sp estimates in, or enhancements for, the graphs are also available.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Two-graph"

1

Ison, Molly Elizabeth. "Two Aspects of Topology in Graph Configuration Spaces." Thesis, Virginia Tech, 2005. http://hdl.handle.net/10919/29214.

Full text
Abstract:
A graph configuration space is generated by the movement of a finite number of robots on a graph. These configuration spaces of points in a graph are topologically interesting objects. By using local, combinatorial properties, we define a new classification of graphs whose configuration spaces are pseudomanifolds with boundary. In algebraic topology, graph configuration spaces are closely related to classical braid groups, which can be described as fundamental groups of configuration spaces of points in the plane. We examine this relationship by finding a presentation for the fundamental group of one graph configuration space.<br>Master of Science
APA, Harvard, Vancouver, ISO, and other styles
2

Yuen, Ching Ki (Simon). "Two distributed algorithms for finding matchings on a graph." Thesis, University of Ottawa (Canada), 1990. http://hdl.handle.net/10393/5970.

Full text
Abstract:
Two new distributed algorithms for finding matchings on a graph are presented. The first algorithm generates a spanning matching. A spanning matching on a graph is one with respect to which no two adjacent nodes are both free. Starting from any matching, the second algorithm proceeds in phases until a maximum matching is found. In each phase, the algorithm finds at least one augmenting path on the graph with respect to the current matching and then augments the current matching. The algorithm terminates when no more augmenting paths can be found. The main features of our algorithms are the use of multiple virtual alternating trees for finding augmenting paths without using messages for synchronization, "shrinking blossoms" and the labelling. Both algorithms are based on asynchronous networks and assume that only local information is available in each process. Our first algorithm has worst-case communication complexity O(m) and time complexity O(n); and our second algorithm has worst-case communication complexity O(mn) and time complexity O(n$\sp2$), where n is the number of nodes and m is the number of edges of the graph.
APA, Harvard, Vancouver, ISO, and other styles
3

Barnett, Kathryn. "The configuration space of two particles moving on a graph." Thesis, Durham University, 2010. http://etheses.dur.ac.uk/293/.

Full text
Abstract:
In this thesis we study the configuration space, F (Γ, 2), of two particles moving without collisions on a graph Γ with a view to calculating the Betti numbers of this space. We develop an intersection theory for cycles in graphs inspired by the classical intersection theory for cycles in manifolds and we use this to develop an algorithm to calculate the second Betti number of F (Γ,2) for any graph Γ. We also use this intersection theory to provide a complete description of the cohomology algebra H ^*(F (Γ, 2), Q) for any planar graph Γ and to calculate explicit formulae for the Betti numbers of F (Γ, 2) when Γ is a complete graph or a complete bipartite graph. We also investigate the generators of group H_2 (F (Γ, 2), Z) and show that for any planar graph this group is entirely generated by tori induced by disjoint cycles in the graph. For non-planar graphs the situation is more complicated and we show that there can exist a generator of H_2 (F (Γ, 2), Z) which is not the fundamental class of a surface embedded in the space F (Γ, 2).
APA, Harvard, Vancouver, ISO, and other styles
4

Reinwardt, Manja. "Combinatorial and graph theoretical aspects of two-edge connected reliability." Doctoral thesis, Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola", 2015. http://nbn-resolving.de/urn:nbn:de:bsz:105-qucosa-184297.

Full text
Abstract:
Die Untersuchung von Zuverlässigkeitsnetzwerken geht bis zum frühen 20. Jahrhundert zurück. Diese Arbeit beschäftigt sich hauptsächlich mit der Zweifach-Kantenzusammenhangswahrscheinlichkeit. Zuerst werden einfache Algorithmen, die aber für allgemeine Graphen nicht effizient sind, gezeigt, zusammen mit Reduktionen. Weiterhin werden Charakterisierungen von Kanten bezogen auf Wegemengen gezeigt. Neue strukturelle Bedingungen für diese werden vorgestellt. Neue Ergebnisse liegen ebenfalls für Graphen hoher Dichte und Symmetrie vor, genauer für vollständige und vollständig bipartite Graphen. Naturgemäß sind Graphen von geringer Dichte hier einfacher in der Untersuchung. Die Arbeit zeigt Ergebnisse für Kreise, Räder und Leiterstrukturen. Graphen mit beschränkter Weg- beziehungsweise Baumweite haben polynomiale Algorithmen und in Spezialfällen einfache Formeln, die ebenfalls vorgestellt werden. Der abschließende Teil beschäftigt sich mit Schranken und Approximationen.
APA, Harvard, Vancouver, ISO, and other styles
5

PESSOA, ARTUR ALVES. "TWO GRAPH OPTIMIZATION PROBLEMS: PIPELINE TRANSPORTATION AND SEARCHING WITH ACCESS COSTS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4356@1.

Full text
Abstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Consideramos dois problemas de otimização combinatória: o problema de transporte em redes de dutos (PTD) e o problema de busca com custos de acesso variados (PBC). No PTD, é dado um grafo orientado G = (N,A) onde cada arco tem um duto associado. Também é dado um conjunto de bateladas, onde cada batelada está inicialmente em um nó ou arco do grafo e tem um nó de destino. Algumas bateladas são chamadas de proteláveis. O objetivo do PTD é encontrar uma sequência de operações que transporte todas as bateladas não-proteláveis aos seus respectivos nós de destino. Primeiro, demonstramos o PTD é NP-difícil, mesmo que o grafo G seja acíclico. Em seguida, apresentamos um algoritmo polinomial chamado de BPA. Este algoritmo resolve o PTDS, uma variação do PTD, para qualquer grafo G. Para grafos acíclicos, o BPA minimiza uma função de custo genérica. Para minimizar o makespan no PTDS, demonstramos que não existe algoritmo polinomial n1-e - aproximado para nenhum E>0, a menos que P = NP, onde n é o tamanho da instância. Este resultado também vale se G é acíclico e planar. No PBC, são dados um vetor ordenado e o custo de acessar cada um de seus n elementos. O objetivo do problema é encontrar uma estratégia de busca que minimize o custo médio com probabilidades uniformes (PBCM) ou o custo do pior caso (PBCN). Em ambos os casos, o melhor algoritmo exato conhecido executa em tempo O(n3) e espaço O(n2). Para o PBCN, apresentamos o algoritmo da razão, que executa em tempo O(n2) e espaço O(n). Este algoritmo sempre obtém uma solução de custo menor ou igual a 41n(n+1)/n, assumindo que a soma dos custos é 1. Além disso, desenvolvemos dois algoritmos aproximados: um para o PBCM e outro para o PBPC. Ambos constroem soluções (2+E+0(1)) - aproximadas, para qualquer E>0, em tempo e espaço O(n).<br>We consider two combinatorial optimization problems the pipeline transportation problem (PTD) and the problem of searching with different access costs (PBC). In PTD, we are given a directed graph G = (N,A) where each arc corresponds to a pipeline. We are also given a set of batches, each batch being initially located at an arc or node and having a destination node. A subset of these batches are considered as further batches. Our aim is to find a sequence of pipeline operations leading all non-further batches to their corresponding destination nodes. First, we show that PDT is NP-hard, even for the case where G is acyclic. Next, we present a polynomial algorithm called BPA. This algorithm solves PTDS, a variation of PTD, for general graphs. For acyclic graphs, BPA also minimizes a general cost function. For the case of makespan minimization for PTDS, we prove that there is no n1-e - approximate algorithm for any E]0, unless P = NP, where n is the instance size. The previous result also holds if G is both ayclic and planar. In PBC, we are given an ordered vector with n elements and the corresponding access costs. Our aim is to find a search strategy that minimizes either the average cost (PBPC). In both cases, the best known exact algorithm requires in O(n3) time and O(n2) space. For PBCM, we present the ratio algorithm, that requires O(n2) time and O(n3)space. This algorithm always obtains a search strategy with average cost at most 41n(n+1)/n, assuming the sum of all access costs to be 1. Furthermore, we introduce approximation algorithms for both PBCM and PBPC. Both of them give (2+E+0(1)) - approximate solutions, for any E}0, in O(n) time and space.
APA, Harvard, Vancouver, ISO, and other styles
6

Mai, Dung Hoang. "A Heuristic for the Constrained One-Sided Two-Layered Crossing Reduction Problem for Dynamic Graph Layout." NSUWorks, 2011. http://nsuworks.nova.edu/gscis_etd/225.

Full text
Abstract:
Data in real-world graph drawing applications often change frequently but incrementally. Any drastic change in the graph layout could disrupt a user's "mental map." Furthermore, real-world applications like enterprise process or e-commerce graphing, where data change rapidly in both content and quantity, demand a comprehensive responsiveness when rendering the graph layout in a multi-user environment in real time. Most standard static graph drawing algorithms apply global changes and redraw the entire graph layout whenever the data change. The new layout may be very different from the previous layout and the time taken to redraw the entire graph degrades quickly as the amount of graph data grows. Dynamic behavior and the quantity of data generated by real-world applications pose challenges for existing graph drawing algorithms in terms of incremental stability and scalability. A constrained hierarchical graph drawing framework and modified Sugiyama heuristic were developed in this research. The goal of this research was to improve the scalability of the constrained graph drawing framework while preserving layout stability. The framework's use of the relational data model shifts the graph application from the traditional desktop to a collaborative and distributed environment by reusing vertex and edge information stored in a relational database. This research was based on the work of North and Woodhull (2001) and the constrained crossing reduction problem proposed by Forster (2004). The result of the constrained hierarchical graph drawing framework and the new Sugiyama heuristic, especially the modified barycenter algorithms, were tested and evaluated against the Graphviz framework and North and Woodhull's (2001) online graph drawing framework. The performance test results showed that the constrained graph drawing framework run time is comparable with the performance of the Graphviz framework in terms of generating static graph layouts, which is independent of database accesses. Decoupling graph visualization from the graph editing modules improved scalability, enabling the rendering of large graphs in real time. The visualization test also showed that the constrained framework satisfied the aesthetic criteria for constrained graph layouts. Future enhancements for this proposed framework include implementation of (1) the horizontal coordinate assignment algorithm, (2) drawing polylines for multilayer edges in the rendering module, and (3) displaying subgraphs for very large graph layouts.
APA, Harvard, Vancouver, ISO, and other styles
7

Plessas, Demitri Joel. "Topos-like properties in two categories of graphs and graph-like features in an abstract category." CONNECT TO THIS TITLE ONLINE, 2008. http://etd.lib.umt.edu/theses/available/etd-05292008-131250/.

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

Belal, Nahla Ahmed. "Two Problems in Computational Genomics." Diss., Virginia Tech, 2011. http://hdl.handle.net/10919/26318.

Full text
Abstract:
This work addresses two novel problems in the field of computational genomics. The first is whole genome alignment and the second is inferring horizontal gene transfer using posets. We define these two problems and present algorithmic approaches for solving them. For the whole genome alignment, we define alignment graphs for representing different evolutionary events, and define a scoring function for those graphs. The problem defined is proven to be NP-complete. Two heuristics are presented to solve the problem, one is a dynamic programming approach that is optimal for a class of sequences that we define in this work as breakable arrangements. And, the other is a greedy approach that is not necessarily optimal, however, unlike the dynamic programming approach, it allows for reversals. For inferring horizontal gene transfer, we define partial order sets among species, with respect to different genes, and infer genes involved in horizontal gene transfer by comparing posets for different genes. The posets are used to construct a tree for each gene. Those trees are then compared and tested for contradiction, where contradictory trees correspond to genes that are candidates of horizontal gene transfer.<br>Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
9

Watkins, Gregory Shroll. "A framework for interpreting noisy, two-dimensional images, based on a fuzzification of programmed, attributed graph grammars." Thesis, Rhodes University, 1998. http://hdl.handle.net/10962/d1004862.

Full text
Abstract:
This thesis investigates a fuzzy syntactic approach to the interpretation of noisy two-dimensional images. This approach is based on a modification of the attributed graph grammar formalism to utilise fuzzy membership functions in the applicability predicates. As far as we are aware, this represents the first such modification of graph grammars. Furthermore, we develop a method for programming the resultant fuzzy attributed graph grammars through the use of non-deterministic control diagrams. To do this, we modify the standard programming mechanism to allow it to cope with the fuzzy certainty values associated with productions in our grammar. Our objective was to develop a flexible framework which can be used for the recognition of a wide variety of image classes, and which is adept at dealing with noise in these images. Programmed graph grammars are specifically chosen for the ease with which they allow one to specify a new two-dimensional image class. We implement a prototype system for Optical Music Recognition using our framework. This system allows us to test the capabilities of the framework for coping with noise in the context of handwritten music score recognition. Preliminary results from the prototype system show that the framework copes well with noisy images.
APA, Harvard, Vancouver, ISO, and other styles
10

Woltering, Matthias [Verfasser]. "Factor Graph-based Receivers for Multi-Carrier Transmission in Two-Way Relaying and Massive Machine Type Communications / Matthias Woltering." Düren : Shaker, 2019. http://d-nb.info/1202218644/34.

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

Books on the topic "Two-graph"

1

Coolen, A. C. C., A. Annibale, and E. S. Roberts. Random graph ensembles. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0003.

Full text
Abstract:
This chapter presents some theoretical tools for defining random graph ensembles systematically via soft or hard topological constraints including working through some properties of the Erdös-Rényi random graph ensemble, which is the simplest non-trivial random graph ensemble where links appear between two nodes with a fixed probability p. The chapter sets out the central representation of graph generation as the result of a discrete-time Markovian stochastic process. This unites the two flavours of graph generation approaches – because they can be viewed as simply moving forwards or backwards through this representation. It is possible to define a random graph by an algorithm, and then calculate the associated stationary probability. The alternative approach is to specify sampling weights and then to construct an algorithm that will have these weights as the stationary probabilities upon convergence.
APA, Harvard, Vancouver, ISO, and other styles
2

Williams, Spensha. Hexagonal Graph Paper - Utah Get Me Two 1980s Movie Quote. Independently Published, 2021.

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

Park, Soonchul. A continuous quadratic programming approach to two-set graph partitioning. 1999.

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

Williams, Spensha. Hexagonal Graph Paper - Utah Get Me Two 1980s Movie Quote. Independently Published, 2021.

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

Hexagonal Graph Paper Two Seater Funny Adult Humor Popular Quote. Independently Published, 2021.

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

Hexagonal Graph Paper - Utah Get Me Two 1980s Movie Quote. Independently Published, 2021.

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

Hexagonal Graph Paper - Muffs Diving School Funny Offensive Scuba Quote Two Sided. Independently Published, 2021.

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

Seed Bead Graph Paper: Beading Graph Paperwith Vintage Cover and with Two Patterns to Create Your Own Beadwork Designs. Independently Published, 2021.

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

Hexagonal Graph Paper Womens Eating Easter Eggs for Two Funny Family Pregnancy Quote. Independently Published, 2021.

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

Hexagonal Graph Paper Womens Eating Easter Eggs for Two Funny Family Pregnancy Quote. Independently Published, 2021.

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

Book chapters on the topic "Two-graph"

1

Shi, Guoyong, Sheldon X. D. Tan, and Esteban Tlelo Cuautle. "Generalized Two-Graph Theory." In Advanced Symbolic Analysis for VLSI Systems. Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-1103-5_6.

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

Newton, Matthew, Ondrej Sýkora, and Imrich Vrt’o. "Two New Heuristics for Two-Sided Bipartite Graph Drawing." In Graph Drawing. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36151-0_29.

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

Carrington, D. A., and K. A. Robinson. "Refinement of two graph problems." In Workshops in Computing. Springer London, 1991. http://dx.doi.org/10.1007/978-1-4471-3756-6_12.

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

Sýkora, O., L. A. Székely, and I. Vrt'o. "Two Counterexamples in Graph Drawing." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36379-3_34.

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

Griffiths, Robert C. "The Two-Locus Ancestral Graph." In Institute of Mathematical Statistics Lecture Notes - Monograph Series. Institute of Mathematical Statistics, 1991. http://dx.doi.org/10.1214/lnms/1215459289.

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

Ghosh, Aakash, and Saraswati Girish Nanoti. "Two Step Graph Protection Game." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-83438-7_19.

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

Makhlouf, Amani, Christian Percebois, and Hanh Nhi Tran. "Two-Level Reasoning About Graph Transformation Programs." In Graph Transformation. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23611-3_7.

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

Tong, Vinh, Dai Quoc Nguyen, Dinh Phung, and Dat Quoc Nguyen. "Two-View Graph Neural Networks for Knowledge Graph Completion." In The Semantic Web. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33455-9_16.

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

Eades, Peter, Antonios Symvonis, and Sue Whitesides. "Two algorithms for three dimensional orthogonal graph drawing." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_44.

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

Mutzel, Petra, and René Weiskircher. "Two-Layer Planarization in Graph Drawing." In Algorithms and Computation. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-49381-6_9.

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

Conference papers on the topic "Two-graph"

1

Jothi, R. Mary Jeya, D. Angel, and Emalda Roslin. "On the Graph Join of Two Graph Classes of SSP Graphs." In 2024 First International Conference on Innovations in Communications, Electrical and Computer Engineering (ICICEC). IEEE, 2024. https://doi.org/10.1109/icicec62498.2024.10808535.

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

Kong, Xiangxu, Fangru Hu, Yichen Song, and Xing Wang. "DGE-ASR: Two-view Graph Neural Networks for Knowledge Graph Completion." In 2024 4th International Conference on Artificial Intelligence, Robotics, and Communication (ICAIRC). IEEE, 2024. https://doi.org/10.1109/icairc64177.2024.10900328.

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

Rezapour, Rezvaneh, Yubin Ge, Kanyao Han, Ray Jeong, and Jana Diesner. "Two-Stage Graph-Augmented Summarization of Scientific Documents." In Proceedings of the 1st Workshop on NLP for Science (NLP4Science). Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.nlp4science-1.5.

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

Ghosh, Anirudha, Anil Tudu, Ankita Mardana, and Debaditya Barman. "A Two-Phase Heuristic Algorithm for Effective Graph Partitioning." In 2024 IEEE Calcutta Conference (CALCON). IEEE, 2024. https://doi.org/10.1109/calcon63337.2024.10914188.

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

Guo, Zhenyuan, Jihe Wu, and Junsheng Mu. "FedHTGL: A Two-Stage Federated Hetero-Task Graph Learning." In 2023 International Conference on Information Processing and Network Provisioning (ICIPNP). IEEE, 2023. https://doi.org/10.1109/icipnp62754.2023.00044.

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

Nayak, Satyajit, Patitapaban Palo, Kwanit Gupta, and Satarupa Uttarkabat. "Graph-Based Two-Three Wheeler Classification in Unconstrained Indian Roads." In 2024 IEEE 27th International Conference on Intelligent Transportation Systems (ITSC). IEEE, 2024. https://doi.org/10.1109/itsc58415.2024.10919487.

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

Dong, Ziyang, Hailun Xia, Naichuan Zheng, and Qingsong Zheng. "Lightweight Attention Graph Convolutional Network for Two-Person Interaction Recognition." In 2024 10th International Conference on Computer and Communications (ICCC). IEEE, 2024. https://doi.org/10.1109/iccc62609.2024.10942175.

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

Fukuhara, Tsutahiro, Junya Hara, Hiroshi Higashi, and Yuichi Tanaka. "Graph Filter Transfer for Time-Varying Signal Estimation Between Two Networks." In 2024 Asia Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC). IEEE, 2024. https://doi.org/10.1109/apsipaasc63619.2025.10848754.

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

Mazza, Francesco, Marcello Caleffi, and Angela Sara Cacciapuoti. "Quantum LAN: On-Demand Network Topology via Two-colorable Graph States." In 2024 International Conference on Quantum Communications, Networking, and Computing (QCNC). IEEE, 2024. http://dx.doi.org/10.1109/qcnc62729.2024.00029.

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

Sun, Zhaoyang, Yudong Zhang, Xuan Yu, et al. "Time-Space-Interlaced Spatiotemporal Graph Forecasting via Two-Stage Summarized Attention." In ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2025. https://doi.org/10.1109/icassp49660.2025.10889478.

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

Reports on the topic "Two-graph"

1

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
2

Gil, Oliver Fernández, and Anni-Yasmin Turhan. Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics. Technische Universität Dresden, 2020. http://dx.doi.org/10.25368/2022.261.

Full text
Abstract:
Classical regular path queries (RPQs) can be too restrictive for some applications and answering such queries under approximate semantics to relax the query is desirable. While for answering regular path queries over graph databases under approximate semantics algorithms are available, such algorithms are scarce for the ontology-mediated setting. In this paper we extend an approach for answering RPQs over graph databases that uses weighted transducers to approximate paths from the query in two ways. The first extension is to answering approximate conjunctive 2-way regular path queries (C2RPQs) over graph databases and the second is to answering C2RPQs over ELH and DL-LiteR ontologies. We provide results on the computational complexity of the underlying reasoning problems and devise approximate query answering algorithms.
APA, Harvard, Vancouver, ISO, and other styles
3

Ramakrishnan, Aravind, Fangyu Liu, Angeli Jayme, and Imad Al-Qadi. Prediction of Pavement Damage under Truck Platoons Utilizing a Combined Finite Element and Artificial Intelligence Model. Illinois Center for Transportation, 2024. https://doi.org/10.36501/0197-9191/24-030.

Full text
Abstract:
For robust pavement design, accurate damage computation is essential, especially for loading scenarios such as truck platoons. Studies have developed a framework to compute pavement distresses as function of lateral position, spacing, and market-penetration level of truck platoons. The established framework uses a robust 3D pavement model, along with the AASHTOWare Mechanistic–Empirical Pavement Design Guidelines (MEPDG) transfer functions to compute pavement distresses. However, transfer functions include high variability and lack physical significance. Therefore, as an improvement to effectively predict permanent deformation, this study utilized a conventional Burger’s model, incorporating a nonlinear power-law dashpot, in lieu of a transfer function. Key components, including stress increments and the Jacobian, were derived for implementation in ABAQUS as a user subroutine. Model parameters were determined through asphalt concrete (AC) flow number and dynamic modulus tests. Using a nonlinear power-law dashpot, the model accurately characterized rutting under varying conditions. The Burger’s model was both verified and validated to check the accuracy of implementation and representative of the actual behavior, respectively. Initially developed in 1D domain, the validated Burger’s model was integrated into the robust 3D finite element (FE) pavement model to predict permanent deformation. A new load-pass approach (LPA) enabled reduction in computational domain and cost, along with implementing transient loads more efficiently. The combined integration of the LPA and the Burger’s model into the pavement model effectively captured the rutting progression per loading cycle. Moreover, a graph neural network (GNN) was established to extend the prediction power of the framework, while strategically limiting the FE numerical matrix. The FE model data was transformed into a graph structure, converting FE model components into corresponding graph nodes and edges. The GNN-based pavement simulator (GPS) was developed to model 3D pavement responses, integrating three key components: encoder, processor, and decoder. The GPS model employed two-layer multilayer perceptrons (MLP) for the encoder and decoder, while utilizing graph network (GN) technology for the processor. Validation occurred through two case studies—OneStep and Rollout—with results compared against FE model data as ground truth. Results demonstrated that the GPS model provides an accurate and computationally efficient alternative to traditional 3D pavement FE simulations.
APA, Harvard, Vancouver, ISO, and other styles
4

Kularatne, Dhanushka N., Subhrajit Bhattacharya, and M. Ani Hsieh. Computing Energy Optimal Paths in Time-Varying Flows. Drexel University, 2016. http://dx.doi.org/10.17918/d8b66v.

Full text
Abstract:
Autonomous marine vehicles (AMVs) are typically deployed for long periods of time in the ocean to monitor different physical, chemical, and biological processes. Given their limited energy budgets, it makes sense to consider motion plans that leverage the dynamics of the surrounding flow field so as to minimize energy usage for these vehicles. In this paper, we present two graph search based methods to compute energy optimal paths for AMVs in two-dimensional (2-D) time-varying flows. The novelty of the proposed algorithms lies in a unique discrete graph representation of the 3-D configuration space spanned by the spatio-temporal coordinates. This enables a more efficient traversal through the search space, as opposed to a full search of the spatio-temporal configuration space. Furthermore, the proposed strategy results in solutions that are closer to the global optimal when compared to greedy searches through the spatial coordinates alone. We demonstrate the proposed algorithms by computing optimal energy paths around the Channel Islands in the Santa Barbara bay using time-varying flow field forecasts generated by the Regional Ocean Model System. We verify the accuracy of the computed paths by comparing them with paths computed via an optimal control formulation.
APA, Harvard, Vancouver, ISO, and other styles
5

Baader, Franz. A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.139.

Full text
Abstract:
In two previous papers we have investigates the problem of computing the least common subsumer (lcs) and the most specific concept (msc) for the description logic EL in the presence of terminological cycles that are interpreted with descriptive semantics, which is the usual first-order semantics for description logics. In this setting, neither the lcs nor the msc needs to exist. We were able to characterize the cases in which the lcs/msc exists, but it was not clear whether this characterization yields decidability of the existence problem. In the present paper, we develop a common graph-theoretic generalization of these characterizations, and show that the resulting property is indeed decidable, thus yielding decidability of the existence of the lcs and the msc. This is achieved by expressing the property in monadic second-order logic on infinite trees. We also show that, if it exists, then the lcs/msc can be computed in polynomial time.
APA, Harvard, Vancouver, ISO, and other styles
6

Соловйов, В. М., та В. В. Соловйова. Моделювання мультиплексних мереж. Видавець Ткачук О.В., 2016. http://dx.doi.org/10.31812/0564/1253.

Full text
Abstract:
From the standpoint of interdisciplinary self-organization theories and synergetics analyzes current approaches to modeling socio-economic systems. It is shown that the complex network paradigm is the foundation on which to build predictive models of complex systems. We consider two algorithms to transform time series or a set of time series to the network: recurrent and graph visibility. For the received network designed dynamic spectral, topological and multiplex measures of complexity. For example, the daily values the stock indices show that most of the complexity measures behaving in a characteristic way in time periods that characterize the different phases of the behavior and state of the stock market. This fact encouraged to use monitoring and prediction of critical and crisis states in socio-economic systems.
APA, Harvard, Vancouver, ISO, and other styles
7

Shapovalov, Yevhenii B., Viktor B. Shapovalov, Roman A. Tarasenko, Stanislav A. Usenko, and Adrian Paschke. A semantic structuring of educational research using ontologies. [б. в.], 2021. http://dx.doi.org/10.31812/123456789/4433.

Full text
Abstract:
This article is devoted to the presentation of the semantic interoperability of research and scientific results through an ontological taxonomy. To achieve this, the principles of systematization and structuration of the scientific/research results in scientometrics databases have been analysed. We use the existing cognitive IT platform Polyhedron and extend it with an ontology-based information model as main contribution. As a proof-of-concept we have modelled two ontological graphs, “Development of a rational way for utilization of methane tank waste at LLC Vasylkivska poultry farm” and “Development a method for utilization of methane tank effluent”. Also, for a demonstration of the perspective of ontological systems for a systematization of research and scientific results, the “Hypothesis test system” ontological graph has created.
APA, Harvard, Vancouver, ISO, and other styles
8

Juden, Matthew, Tichaona Mapuwei, Till Tietz, et al. Process Outcome Integration with Theory (POInT): academic report. Centre for Excellence and Development Impact and Learning (CEDIL), 2023. http://dx.doi.org/10.51744/crpp5.

Full text
Abstract:
This paper describes the development and testing of a novel approach to evaluating development interventions – the POInT approach. The authors used Bayesian causal modelling to integrate process and outcome data to generate insights about all aspects of the theory of change, including outcomes, mechanisms, mediators and moderators. They partnered with two teams who had evaluated or were evaluating complex development interventions: The UPAVAN team had evaluated a nutrition-sensitive agriculture intervention in Odisha, India, and the DIG team was in the process of evaluating a disability-inclusive poverty graduation intervention in Uganda. The partner teams’ theory of change were adapted into a formal causal model, depicted as a directed acyclic graph (DAG). The DAG was specified in the statistical software R, using the CausalQueries package, having extended the package to handle large models. Using a novel prior elicitation strategy to elicit beliefs over many more parameters than has previously been possible, the partner teams’ beliefs about the nature and strength of causal links in the causal model (priors) were elicited and combined into a single set of shared prior beliefs. The model was updated on data alone as well as on data plus priors to generate posterior models under different assumptions. Finally, the prior and posterior models were queried to learn about estimates of interest, and the relative role of prior beliefs and data in the combined analysis.
APA, Harvard, Vancouver, ISO, and other styles
9

Cram, Jana, Mary Levandowski, Kaci Fitzgibbon, and Andrew Ray. Water resources summary for the Snake River and Jackson Lake Reservoir in Grand Teton National Park and John D. Rockefeller, Jr. Memorial Parkway: Preliminary analysis of 2016 data. National Park Service, 2021. http://dx.doi.org/10.36967/nrr-2285179.

Full text
Abstract:
This report summarizes discharge and water quality monitoring data for the Snake River and Jackson Lake reservoir levels in Grand Teton National Park and John D. Rockefeller, Jr. Memorial Parkway for calendar year 2016. Annual and long-term discharge summaries and an evaluation of chemical conditions relative to state and federal water quality standards are presented. These results are considered provisional, and may be subject to change. River Discharge: Hydrographs for the Snake River at Flagg Ranch, WY, and Moose, WY, exhibit a general pattern of high early summer flows and lower baseflows occurring in late summer and fall. During much of 2016, flows at the Flagg Ranch monitoring location were similar to the 25th percentile of daily flows at that site. Peak flows at Flagg Ranch were similar to average peak flow from 1983 to 2015 but occurred eleven days earlier in the year compared to the long-term average. Peak flows and daily flows at the Moose monitoring station were below the long-term average. Peak flows occurred four days later than the long-term average. During summer months, the unnatural hydro-graph at the Moose monitoring location exhibited signs of flow regulation associated with the management of Jackson Lake. Water Quality Monitoring in the Snake River: Water quality in the Snake River exhibited seasonal variability over the sampling period. Specifically, total iron peaked during high flows. In contrast, chloride, sulfate, sodium, magnesium, and calcium levels were at their annual minimum during high flows. Jackson Lake Reservoir: Reservoir storage dynamics in Jackson Lake exhibit a pattern of spring filling associated with early snowmelt runoff reaching maximum storage in mid-summer (on or near July 1). During 2016, filling water levels and reservoir storage began to increase in Jackson Lake nearly two weeks earlier than the long-term average and coincident with increases in runoff-driven flows in the Snake River. Although peak storage in Jackson Lake was larger and occurred earlier than the long-term average, minimum storage levels were similar to the long-term average.
APA, Harvard, Vancouver, ISO, and other styles
10

Monetary Policy Report, July 2023. Banco de la República, 2023. http://dx.doi.org/10.32468/inf-pol-mont-eng.tr3-2023.

Full text
Abstract:
In the second quarter of 2023, total annual infation fell to 12.1% and the rise of core infation halted and stood at 10.5%; both measures were lower than those forecasted in the April Report but remained well above the 3.0% target. The aggregate effects of monetary policy actions and the unwinding of certain shocks that affected prices will contribute towards bringing infation closer to the target in 2024. By component, the annual variations in the CPI for food and the CPI excluding food and regulated items have lessened more markedly than anticipated by the Central Bank’s technical staff, underlying the decline in annual infation. However, prices of regulated items and services continued to rise, nonetheless at a slower pace than expected, particularly in the case of services. For these two groups, price indexation mechanisms have resulted in the transmission of some transitory increases in certain CPI sub-components (e.g., food) to other items (e.g., rents, utilities, etc.), thus generating a greater persistence of already high infation. This is acerbated by the gasoline price increases required to correct the defcit of the Fuel Price Stabilization Fund (Fondo de Estabilización de los Precios de los Combustibles, FEPC). Consequently, the CPI for regulated items forecast increased going forward relative to the April Report given the higher gasoline price adjustments announced by the Government. For the remaining items (food, goods, and services), the forecasted trajectory declined due partly to the lower-than-estimated infation, a more notable reduction in the international prices of some food items and freight costs, lower exchange rate and cost pressures on prices, and a faster than anticipated decrease in excess demand. This occurs in a contractionary monetary policy environment that aims to reduce infation towards rates close to the 3.0% target by the end of 2024. Against this background, headline infation for yearend 2023 is forecast at 9.0% (formerly 9.5%) and 3.5% for yearend 2024 (previously 3.4%) (Graph 1.1). In the same timeframes, the core infation forecast has been revised downward from 8.9% to 7.9%, and from 3.9% to 3.7%, respectively (Graph 1.2). These projections are subject to high uncertainty, especially surrounding future behavior of international fnancing conditions and the exchange rate, fuctuations in domestic demand, the possible occurrence of the El Niño natural climate phenomenon, and future decisions regarding domestic fuel and electricity prices.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Two-graph' 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