Log in

Relevant bibliographies by topics / EDGE TEST TREE GRAPH

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'EDGE TEST TREE GRAPH'

Author: Grafiati

Published: 11 September 2023

Last updated: 31 July 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 'EDGE TEST TREE 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 "EDGE TEST TREE GRAPH"

1

Guo, Mingyu, Jialiang Li, Aneta Neumann, Frank Neumann, and Hung Nguyen. "Limited Query Graph Connectivity Test." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 18 (2024): 20718–25. http://dx.doi.org/10.1609/aaai.v38i18.30059.

Full text

Abstract:

We propose a combinatorial optimisation model called Limited Query Graph Connectivity Test. We consider a graph whose edges have two possible states (On/Off). The edges' states are hidden initially. We could query an edge to reveal its state. Given a source s and a destination t, we aim to test s−t connectivity by identifying either a path (consisting of only On edges) or a cut (consisting of only Off edges). We are limited to B queries, after which we stop regardless of whether graph connectivity is established. We aim to design a query policy that minimizes the expected number of queries. Ou

APA, Harvard, Vancouver, ISO, and other styles

2

Wei, Yuxuan, Zhinan Gao, and Xingyan Lu. "The Complexity of Wheel Graphs with Multiple Edges and Vertices." Asian Research Journal of Mathematics 19, no. 9 (2023): 1–12. http://dx.doi.org/10.9734/arjom/2023/v19i9694.

Full text

Abstract:

In this paper, we focus on calculate the number of spanning trees of the general wheel graphs, which meansthe original wheel graphs adding large amount of vertices and edges. Particularly, we introduce the C-graphand deduce a new equation that computing the spanning trees by removing C-graphs instead of edges.In Addition, we test our results by Kirchhoff’s matrix-tree theorem in some simple cases and provide thetree entropy of the general wheel graphs. Finally, we analyse the relation between the wheel graph anddouble-wheel graphs and propose the idea of calculating the spanning trees of doubl

APA, Harvard, Vancouver, ISO, and other styles

3

Dhanashri Korpad, Nisha Satpute, Nayana Joshi, Snehal Kulkarni, Komal Walgude, and Neha Dhadiwal. "Numerical Data Processing by The Implementation of Trees and Graphs." International Research Journal on Advanced Engineering and Management (IRJAEM) 2, no. 11 (2024): 3256–60. http://dx.doi.org/10.47392/irjaem.2024.0479.

Full text

Abstract:

Trees and Graphs play a vital role in transport and logistics. In tree, decision tree is one of the important, not only implemented for data processing, but also considered for Numerical data analysis. The decision tree is a flow chart-like structure, in which each internal node represents a ‘test’ on an attribute, which has a node known as root being at the top, which further divides the given data into branches depending upon the conditions. Every branch consists of a rule, and each leaf node is its outcome. A support tool with a tree-like structure that models probable outcomes, cost of res

APA, Harvard, Vancouver, ISO, and other styles

4

Wamiliana, Wamiliana. "SOLVING THE DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM USING TABU AND MODIFIED PENALTY SEARCH METHODS." Jurnal Teknik Industri 6, no. 1 (2005): 1–9. http://dx.doi.org/10.9744/jti.6.1.1-9.

Full text

Abstract:

In this paper we consider the Degree Constrained Minimum Spanning Tree Problem. This problem is concerned with finding, in a given edge weighted graph G (all weights are non-negative), the minimum weight spanning tree T satisfying specified degree restrictions on the vertices. This problem arises naturally in communication networks where the degree of a vertex represents the number of line interfaces available at a center. Because of its NP-completeness, a number of heuristics have been proposed. In this paper we propose two new search methods: one based on the method of Tabu search and the ot

APA, Harvard, Vancouver, ISO, and other styles

5

Batsamut, V. M., S. O. Hodlevsky, Yu P. Babkov, and D. A. Morkvin. "METHOD OF CREATING A MINIMAL SPANNING TREE ON AN ARBITRARY SUBSET OF VERTICES OF A WEIGHTED UNDIRECTED GRAPH." Radio Electronics, Computer Science, Control, no. 1 (April 2, 2024): 188. http://dx.doi.org/10.15588/1607-3274-2024-1-17.

Full text

Abstract:

Context. The relevance of the article is determined by the need for further development of models for optimal restoration of the connectivity of network objects that have undergone fragmentation due to emergency situations of various origins. The method proposed in this article solves the problematic situation of minimizing the amount of restoration work (total financial costs) when promptly restoring the connectivity of a selected subset of elements of a network object after its fragmentation. The purpose of the study is to develop a method for creating a minimal spanning tree on an arb

APA, Harvard, Vancouver, ISO, and other styles

6

Zhong, Shuaihao, Duoqiang Wang, Wei Li, Feng Lu, and Hai Jin. "Burner: Recipe Automatic Generation for HPC Container Based on Domain Knowledge Graph." Wireless Communications and Mobile Computing 2022 (May 25, 2022): 1–14. http://dx.doi.org/10.1155/2022/4592428.

Full text

Abstract:

As one of the emerging cloud computing technologies, containers are widely used in academia and industry. The cloud computing built by the container in the high performance computing (HPC) center can provide high-quality services to users at the edge. Singularity Definition File and Dockerfile (we refer to such files as recipes) have attracted wide attention due to their encapsulation of the application running environment in a container. However, creating a recipe requires extensive domain knowledge, which is error-prone and time-consuming. Accordingly, more than 34% of Dockerfiles in Github

APA, Harvard, Vancouver, ISO, and other styles

7

Gilani, S. A. N., M. Awrangjeb, and G. Lu. "FUSION OF LIDAR DATA AND MULTISPECTRAL IMAGERY FOR EFFECTIVE BUILDING DETECTION BASED ON GRAPH AND CONNECTED COMPONENT ANALYSIS." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XL-3/W2 (March 10, 2015): 65–72. http://dx.doi.org/10.5194/isprsarchives-xl-3-w2-65-2015.

Full text

Abstract:

Building detection in complex scenes is a non-trivial exercise due to building shape variability, irregular terrain, shadows, and occlusion by highly dense vegetation. In this research, we present a graph based algorithm, which combines multispectral imagery and airborne LiDAR information to completely delineate the building boundaries in urban and densely vegetated area. In the first phase, LiDAR data is divided into two groups: ground and non-ground data, using ground height from a bare-earth DEM. A mask, known as the primary building mask, is generated from the non-ground LiDAR points where

APA, Harvard, Vancouver, ISO, and other styles

8

Chimani, Markus, Giuseppe Di Battista, Fabrizio Frati, and Karsten Klein. "Advances on Testing C-Planarity of Embedded Flat Clustered Graphs." International Journal of Foundations of Computer Science 30, no. 02 (2019): 197–230. http://dx.doi.org/10.1142/s0129054119500011.

Full text

Abstract:

In this paper, we show a polynomial-time algorithm for testing [Formula: see text]-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face. Our result is based on a reduction to the planar set of spanning trees in topological multigraphs (pssttm) problem, which is defined as follows. Given a (non-planar) topological multigraph [Formula: see text] with [Formula: see text] connected components [Formula: see text], do spanning trees of [Formula: see text] exist such that no two edges in any two spanning trees cross? Kratochvíl et al. [SIAM Journal on Discret

APA, Harvard, Vancouver, ISO, and other styles

9

Bu, Weijun. "Data or mathematics? Solutions to semantic problems in artificial intelligence." Journal of Computational Methods in Sciences and Engineering 24, no. 4-5 (2024): 2847–61. http://dx.doi.org/10.3233/jcm-247520.

Full text

Abstract:

Data support is already driving the development of artificial intelligence. But it cannot solve the semantic problem of artificial intelligence. This requires improving the semantic understanding ability of artificial intelligence. Therefore, a question answering system based on semantic problem processing is proposed in this study. The question answering system utilizes an improved unsupervised method to extract keywords. This technology integrates the semantic feature information of text into traditional word graph model algorithms. On this basis, semantic similarity information is used to c

APA, Harvard, Vancouver, ISO, and other styles

10

Abbasi, Mozhgan, Jochem Verrelst, Mohsen Mirzaei, Safar Marofi, and Hamid Reza Riyahi Bakhtiari. "Optimal Spectral Wavelengths for Discriminating Orchard Species Using Multivariate Statistical Techniques." Remote Sensing 12, no. 1 (2019): 63. http://dx.doi.org/10.3390/rs12010063.

Full text

Abstract:

Sustainable management of orchard fields requires detailed information about the tree types, which is a main component of precision agriculture programs. To this end, hyperspectral imagery can play a major role in orchard tree species mapping. Efficient use of hyperspectral data in combination with field measurements requires the development of optimized band selection strategies to separate tree species. In this study, field spectroscopy (350 to 2500 nm) was performed through scanning 165 spectral leaf samples of dominant orchard tree species (almond, walnut, and grape) in Chaharmahal va Bakh

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "EDGE TEST TREE GRAPH"

1

Jones, Brian Douglas. "Tree components in random graph processes with non-uniform edge probabilities /." The Ohio State University, 1995. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487867541733461.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bouchat, Rachelle R. "ALGEBRAIC PROPERTIES OF EDGE IDEALS." UKnowledge, 2008. http://uknowledge.uky.edu/gradschool_diss/618.

Full text

Abstract:

Given a simple graph G, the corresponding edge ideal IG is the ideal generated by the edges of G. In 2007, Ha and Van Tuyl demonstrated an inductive procedure to construct the minimal free resolution of certain classes of edge ideals. We will provide a simplified proof of this inductive method for the class of trees. Furthermore, we will provide a comprehensive description of the finely graded Betti numbers occurring in the minimal free resolution of the edge ideal of a tree. For specific subclasses of trees, we will generate more precise information including explicit formulas for the project

APA, Harvard, Vancouver, ISO, and other styles

3

Gouveia, da silva Thiago. "The Minimum Labeling Spanning Tree and Related Problems." Thesis, Avignon, 2018. http://www.theses.fr/2018AVIG0278.

Full text

Abstract:

Soit L un ensemble fini d’éléments appelés étiquettes. On appelle graphe étiqueté simple, un graphe simple dans lequel à chaque arête est associée une étiquette prise dans L. Le problème de l’arbre couvrant de nombre d’étiquettes minimal (en anglais: the minimum labeling spanning tree problem, MLSTP) est un problème d’optimisation combinatoire consistant à trouver un arbre couvrant dans un graphe étiqueté simple en utilisant un nombre minimum d’étiquettes. Le problème est NP-dur. Il a fait l’objet d’un nombre important de recherche au cours des dernières années. L’une de ces directions de rech

APA, Harvard, Vancouver, ISO, and other styles

4

Bencke, Cinara Salete Curra. "Estudo da fenologia de espécies arbóreas em uma floresta semidecídua no Parque Estadual de Itapuã, Viamão, RS." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2005. http://hdl.handle.net/10183/10000.

Full text

Abstract:

O presente estudo foi realizado em uma floresta semidecídua no Parque Estadual de Itapuã, no município de Viamão, RS. Este trabalho teve como objetivos: a) descrever e comparar o comportamento fenológico de espécies arbóreas em duas formações fisionômica distintas – uma área de interior de floresta e outra de borda; b) realizar análises de correlação entre as fenofases e as variáveis climáticas pluviosidade e temperatura para o período de estudo e para os seis meses anteriores, e também verificar a existência de correlação entre as fenofases e os dados médios de pluviosidade e temperatura para

APA, Harvard, Vancouver, ISO, and other styles

5

Meinhardt, Llopis Enric. "Morphological and statistical techniques for the analysis of 3D images." Doctoral thesis, Universitat Pompeu Fabra, 2011. http://hdl.handle.net/10803/22719.

Full text

Abstract:

Aquesta tesi proposa una estructura de dades per emmagatzemar imatges tridimensionals. L'estructura da dades té forma d'arbre i codifica les components connexes dels conjunts de nivell de la imatge. Aquesta estructura és la eina bàsica per moltes aplicacions proposades: operadors morfològics tridimensionals, visualització d'imatges mèdiques, anàlisi d'histogrames de color, seguiment d'objectes en vídeo i detecció de vores. Motivada pel problema de la completació de vores, la tesi conté un estudi de com l'eliminació de soroll mitjançant variació total anisòtropa es pot fer servir pe

APA, Harvard, Vancouver, ISO, and other styles

6

Ouyang, Qiancheng. "Some colouring problems in edge/vertex-coloured graphs : Structural and extremal studies." Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG060.

Full text

Abstract:

La coloration de graphes est l'un des sujets les plus connus, populaires et largement étudiés dans le domaine de la théorie des graphes, avec une vaste littérature comprenant des approches provenant de nombreux domaines ainsi que de nombreux problèmes qui sont encore ouverts et étudiés par divers mathématiciens et informaticiens à travers le monde. Le Problème des Quatre Couleurs, à l'origine de l'étude de la coloration des graphes, a été l'un des problèmes centraux en théorie des graphes au siècle dernier. Il demande s'il est possible de colorer proprement chaque graphe planaire avec quatre c

APA, Harvard, Vancouver, ISO, and other styles

7

Tahraoui, Mohammed Amin. "Coloring, packing and embedding of graphs." Phd thesis, Université Claude Bernard - Lyon I, 2012. http://tel.archives-ouvertes.fr/tel-00995041.

Full text

Abstract:

In this thesis, we investigate some problems in graph theory, namelythe graph coloring problem, the graph packing problem and tree pattern matchingfor XML query processing. The common point between these problems is that theyuse labeled graphs.In the first part, we study a new coloring parameter of graphs called the gapvertex-distinguishing edge coloring. It consists in an edge-coloring of a graph G whichinduces a vertex distinguishing labeling of G such that the label of each vertex isgiven by the difference between the highest and the lowest colors of its adjacentedges. The minimum number of

APA, Harvard, Vancouver, ISO, and other styles

8

GOEL, RUCHI. "A PARADIGM FOR TESTING WEB APPLICATION." Thesis, 2011. http://dspace.dtu.ac.in:8080/jspui/handle/repository/13894.

Full text

Abstract:

M.TECH<br>For any work of literature, a fundamental issue is to identify the individual(s) who wrote it, and conversely, to identify all of the works that belong to a given individual or to identify the individual who writes many papers on same topic. A web application is an application that can be accessed via a web browser over a network. Web applications contain client side code and server side code. Web applications undergo changes in the maintenance phase, and retesting changed programs is done thereafter. To retest a program after changes, we can select a subset of the whole test sui

APA, Harvard, Vancouver, ISO, and other styles

9

Klimošová, Tereza. "Immersions and edge-disjoint linkages." Master's thesis, 2011. http://www.nusl.cz/ntk/nusl-313889.

Full text

Abstract:

Graph immersions are a natural counterpart to the widely studied concepts of graph minors and topological graph minors, and yet their theory is much less developed. In the present work we search for sufficient conditions for the existence of the immersions and the properties of the graphs avoiding an immersion of a fixed graph. We prove that large tree-with of 4-edge-connected graph implies the existence of immersion of any 4-regular graph on small number of vertices and that large maximum degree of 3-edge-connected graph implies existence of immersion of any 3-regular graph on small number of

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "EDGE TEST TREE GRAPH"

1

Boyacı, Arman, Tınaz Ekim, Mordechai Shalom, and Shmuel Zaks. "Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45043-3_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ajith E and Uma N. "SCRIBO: A Graph Visualizer & Analytical Tool." In Advances in Transdisciplinary Engineering. IOS Press, 2023. http://dx.doi.org/10.3233/atde221254.

Full text

Abstract:

Data science is a very visual field of computer science where everything needs to be depicted graphically in order to derive new forms of data and conclusions from it. This paper introduces visualization techniques where graphs can be better rendered using advance techniques such as vertex and edge clipping against the view port, rendering a large drawing area by panning the view port to focus on a specific region, labelling vertex data with numeric , text and images and advanced analytic algorithms such as analyzing and finding the shortest path between two vertices using Dijkstra’s, Floyd, f

APA, Harvard, Vancouver, ISO, and other styles

3

Nardelli, Enrico, Guido Proietti, and Peter Widmayer. "Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures." In Graph Algorithms and Applications 2. WORLD SCIENTIFIC, 2004. http://dx.doi.org/10.1142/9789812794741_0020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Long, Yinyan, Xiaoxia Li, Zhuming Long, Fuying Wu, and Hao Long. "A Novel Heuristics for the Strong Generalized Minimum Label Spanning Tree Problem." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2023. http://dx.doi.org/10.3233/faia230914.

Full text

Abstract:

The strong generalized minimum label spanning tree problem (SGMLSTP) is to search the minimum label spanning tree (MLST) from an Edge-labeled graph (ELG), in which each edge is associated with one or more labels. SGMLSTP is commonly existed in reality and proven NP-hard. In recent years, researchers have proposed some algorithms; however, high computational costs are still severe obstacle, especially for large size graphs. In this paper, we propose a novel heuristics to solve SGMLSTP. We decompose the problem into two sub-problems, one is to search a connected subgraph with minimum labels from

APA, Harvard, Vancouver, ISO, and other styles

5

Linganathan, Shayathri, and Purusotham Singamsetty. "Solving Neutrosophic Minimum Spanning Tree Problem by Least Edge Weight Algorithm." In Advances in Chemical and Materials Engineering. IGI Global, 2024. https://doi.org/10.4018/979-8-3693-3204-7.ch021.

Full text

Abstract:

A minimum spanning tree problem (MST) is a tree that identifies a subset of edges which connects all the vertices of a connected, undirected, and edge-weighted graph with the least total weight. In general, the edge weight can be distance, cost, time, etc. However, in case of any ambiguity of information, the edge weight may not be a deterministic value. A neutrosophic set is a powerful tool for complexity, dealing with imprecise, ambiguous, and inconsistent information in the actual wide world. In neutrosophic MST, the edge weight is represented by a neutrosophic number set. When compared to

APA, Harvard, Vancouver, ISO, and other styles

6

Lin Chen-Wan and Wu Bang Ye. "A 2-approximation algorithm for the clustered minimum routing cost tree problem." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2015. https://doi.org/10.3233/978-1-61499-484-8-3.

Full text

Abstract:

The minimum routing cost spanning tree problem is a classic NP-hard problem, even for metric graphs. Given an edge-weighted graph, the problem asks for a spanning tree minimizing the sum of distances between all pairs of vertices. In this paper, we investigate a new variant named clustered minimum routing cost tree (CLUSTER MRCT) problem on metric graphs, in which the vertices are partitioned into clusters and the subtrees spanning clusters must be mutually disjoint in a feasible clustered spanning tree. We design a 2-approximation algorithm with time complexity O(n2) for CLUSTER MRCT, where n

APA, Harvard, Vancouver, ISO, and other styles

7

Hosseininia, Mahtab, and Faraz Dadgostari. "Connectivity." In Graph Theory for Operations Research and Management. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2661-4.ch004.

Full text

Abstract:

In this chapter, the concept of graph connectivity is introduced. In the first section, some concepts such as walk, path, component and connected graph are defined, and connectedness of a graph from the viewpoint of vertex connectivity, and also, edge connectivity are discussed. Then, blocks and block tree of graphs are illustrated. In addition, connectivity in directed graphs is introduced. Furthermore, in the last section, two graph traversal algorithms, depth first search and breadth first search, are described to investigate the connectedness of directed and undirected graphs.

APA, Harvard, Vancouver, ISO, and other styles

8

Karpinski, Marek, and Wojciech Rytter. "Four easy subclasses of graphs." In Fast Parallel Algorithms for Graph Matching Problems. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198501626.003.0009.

Full text

Abstract:

Abstract In this chapter we consider three easy cases of matchings in special graphs: trees, dense graphs and regular bipartite graphs. They are easy in the sense of possessing simple NC-algorithms for the matching problem. Usually efficient sequential algorithms for trees also have quite efficient parallel implementations. Regular bipartite and dense graphs are among the few known families of graphs which possess perfect matchings. A tree is an undirected connected graph without cycles. Assume we choose a vertex called a root and direct all edges top down. The root is the topmost vertex. The

APA, Harvard, Vancouver, ISO, and other styles

9

Read, Ronald C., and Robin J. Wilson. "Trees." In An Atlas Of Graphs. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198532897.003.0002.

Full text

Abstract:

Abstract A tree is a connected graph that has no cycles. If a tree has n vertices, then it has n − 1 edges, and any tree with more than one vertex has at least two end-vertices (vertices of degree 1). In any tree, there is a unique path between any two given vertices, and the removal of any edge disconnects the tree. A rooted tree is a tree in which a particular vertex, the root, has been singled out. A tree is homeomorphically irreducible if it has no vertices of degree 2. An identity tree is a tree whose only automorphism is the identity map—that is, a tree with no non-trivial symmetries. Fo

APA, Harvard, Vancouver, ISO, and other styles

10

He, Long, Xiangfu Zhao, Yichen Wang, Jiahui Yang, and Xuelei Sun. "GraphSA: Smart Contract Vulnerability Detection Combining Graph Neural Networks and Static Analysis." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2023. http://dx.doi.org/10.3233/faia230374.

Full text

Abstract:

Security incidents in smart contracts still occur frequently, as the underlying code is often vulnerable to attacks. However, traditional methods to detect vulnerabilities in smart contracts are limited by certain rigid rules, reducing accuracy and scalability. In this work, we propose GraphSA, which combines Graph neural networks (GNNs) and Static Analysis for smart contract vulnerability detection. First, we present the contract tree, which is obtained by converting the control flow graph (CFG) of a smart contract. Each node in the tree represents a crucial operation code (opcode) block, and

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "EDGE TEST TREE GRAPH"

1

Pluska, Alexander, Pascal Welke, Thomas Gärtner, and Sagar Malhotra. "Logical Distillation of Graph Neural Networks." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/86.

Full text

Abstract:

We present a logic based interpretable model for learning on graphs and an algorithm to distill this model from a Graph Neural Network (GNN). Recent results have shown connections between the expressivity of GNNs and the two-variable fragment of first-order logic with counting quantifiers (C2). We introduce a decision-tree based model which leverages an extension of C2 to distill interpretable logical classifiers from GNNs. We test our approach on multiple GNN architectures. The distilled models are interpretable, succinct, and attain similar accuracy to the underlying GNN. Furthermore, when t

APA, Harvard, Vancouver, ISO, and other styles

2

Wu, Qinzhuo, Qi Zhang, and Zhongyu Wei. "An Edge-Enhanced Hierarchical Graph-to-Tree Network for Math Word Problem Solving." In Findings of the Association for Computational Linguistics: EMNLP 2021. Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/2021.findings-emnlp.127.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Huang, Tianhao, Guohao Dai, Yu Wang, and Huazhong Yang. "HyVE: Hybrid vertex-edge memory hierarchy for energy-efficient graph processing." In 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 2018. http://dx.doi.org/10.23919/date.2018.8342150.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Feng, Yuhong, Meihong Guo, Kezhong Lu, et al. "Optimize the FP-Tree Based Graph Edge Weight Computation on Multi-core MapReduce Clusters." In 2017 IEEE 23rd International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2017. http://dx.doi.org/10.1109/icpads.2017.00060.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lu, Zhicheng, Ruochen Li, Huamiao Hu, and Wen-an Zhou. "A code clone detection algorithm based on graph convolution network with AST tree edge." In 2021 IEEE 21st International Conference on Software Quality, Reliability and Security Companion (QRS-C). IEEE, 2021. http://dx.doi.org/10.1109/qrs-c55045.2021.00156.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Muresan, Valentin, X. Wang, Valentina Muresan, and M. Vladutiu. "The left edge algorithm and the tree growing technique in block-test scheduling under power constraints." In Proceedings 18th IEEE VLSI Test Symposium. IEEE, 2000. http://dx.doi.org/10.1109/vtest.2000.843873.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Junetty, Rakel, Diari Indriati, and Bowo Winarno. "Edge irregular reflexive labeling of palm tree graph C3−B2,r and C3−B3,r." In INTERNATIONAL CONFERENCE OF MATHEMATICS AND MATHEMATICS EDUCATION (I-CMME) 2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0116566.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Da Silva, Thiago Gouveia. "The Minimum Labeling Spanning Tree and Related Problems." In XXXII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/ctd.2019.6333.

Full text

Abstract:

The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple edge-labeled graph, i.e., a graph in which each edge has one label associated, by using a minimum number of labels. It is an NP-hard problem that has attracted substantial research attention in recent years. In its turn, the generalized minimum labeling spanning tree problem (GMLSTP) is a generalization of the MLSTP that allows the situation in which multiple labels can be assigned to an edge. Both problems have several practical applications in import

APA, Harvard, Vancouver, ISO, and other styles

9

Belli, Fevzi, Axel Hollmann, and Markus Kleinselbeck. "A Graph-Model-Based Testing Method Compared with the Classification Tree Method for Test Case Generation." In 2009 Third IEEE International Conference on Secure Software Integration and Reliability Improvement (SSIRI). IEEE, 2009. http://dx.doi.org/10.1109/ssiri.2009.40.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Hebrard, Emmanuel, and George Katsirelos. "Clause Learning and New Bounds for Graph Coloring." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/856.

Full text

Abstract:

Graph coloring is a major component of numerous allocation and scheduling problems. We introduce a hybrid CP/SAT approach to graph coloring based on exploring Zykov’s tree: for two non-neighbors, either they take a different color and there might as well be an edge between them, or they take the same color and we might as well merge them. Branching on whether two neighbors get the same color yields a symmetry-free tree with complete graphs as leaves, which correspond to colorings of the original graph. We introduce a new lower bound for this problem based on Mycielskian graphs; a method to pro

APA, Harvard, Vancouver, ISO, and other styles

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!