Výsledky vyhľadávania - "graph theory and algorithms"

Graph Theory and Algorithms for Network Analysis Autor Arul, Sharmila Mary, Senthil, Gowri, Jayasudha, S., Alkhayyat, Ahmed, Azam, Khalikov, Elangovan, R.

“… played by graph theory and algorithms. In order to give a comprehensive review of the graph theory and network analysis methods, this abstract will focus on their significance, practical uses, and most recent developments…”
Získať plný text

Biological Network Analysis: Trends, Approaches, Graph Theory, and Algorithms Autor Guzzi, Pietro Hiram, Roy, Swarup

“…Biological Network Analysis: Trends, Approaches, Graph Theory, and Algorithms considers three major biological networks, including Gene Regulatory Networks (GRN…”
Získať plný text

Graph theory and algorithms: Fourth Latin-American Workshop on Cliques in Graphs Autor de Figueiredo, Celina M. H., Szwarcfiter, Jayme L.

“…Issue Title: GraphCliques…”
Získať plný text

Graph Playground: A Pedagogic Tool for Graph Theory and Algorithms Autor Adhikari, Neeraj

“…A system called Graph Playground has been created to enhance the teaching of introductory graph theory and graph algorithms presented in courses like CSC 340,…”
Získať plný text

Averting Cascading Failures in Networked Infrastructures: Poset-Constrained Graph Algorithms Autor Yu, Pei-Duo, Tan, Chee Wei, Fu, Hung-Lin

“…Cascading failures in critical networked infrastructures that result even from a single source of failure often lead to rapidly widespread outages as witnessed…”
Získať plný text

Efficient algorithms for scheduling multiple bulk data transfers in inter-datacenter networks Autor Su, Sen, Wang, Yiwen, Jiang, Sujuan, Shuang, Kai, Xu, Peng

“…SUMMARYBulk data transfers, such as backups and propagation of bulky updates, account for a large portion of the inter‐datacenter traffic. These bulk transfers…”
Získať plný text

Complexity of greedy edge-colouring Autor Havet, Frédéric, Maia, A. Karolinna, Yu, Min-Li

“…The Grundy index of a graph G =(V, E ) is the greatest number of colours that the greedy edge-colouring algorithm can use on G . We prove that the problem of…”
Získať plný text

Chordal- (k,ℓ)and strongly chordal- (k,ℓ)graph sandwich problems Autor Couto, Fernanda, Faria, Luerbio, Klein, Sulamita

“…Background In this work, we consider the graph sandwich decision problem for property Π , introduced by Golumbic, Kaplan and Shamir: given two graphs G 1 =( V…”
Získať plný text

Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees Autor Tahir, Muhammad Atif, Jamshed, Asif, Rehman, Habib-ur, Daadaa, Yassine

“…In a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the…”
Získať plný text

Graph theory and algorithms: Various approaches to utilization of virtual learning environment Autor Milkova, E.

“…The paper focuses on experiences gained during the last years with the WebCT virtual learning environment together with multimedia applications supported…”
Získať plný text

Searching the Nodes of a Graph: Theory and Algorithms Autor Kehagias, Ath, Hollinger, G, Gelastopoulos, A

“…One or more searchers must capture an invisible evader hiding in the nodes of a graph. We study this graph search problem; we emphasize that we study the…”
Získať plný text

Node Immunization on Large Graphs: Theory and Algorithms Autor Chen Chen, Hanghang Tong, Prakash, B. Aditya, Tsourakakis, Charalampos E., Eliassi-Rad, Tina, Faloutsos, Christos, Duen Horng Chau

“…Given a large graph, like a computer communication network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against…”
Získať plný text

Printed circuit boards isomorphism: An experimental study Autor Abiad, Aida, Grigoriev, Alexander, Niemzok, Stefanie

“…We evaluate the discrimination power of different graph invariants in order to identify an appropriate measurement of similarity among printed circuit boards…”
Získať plný text

Structural and Functional Analysis of Multi-Interface Domains Autor Zhao, Liang, Hoi, Steven C. H., Wong, Limsoon, Hamp, Tobias, Li, Jinyan

“… This work applies graph theory and algorithms to discover fingerprints for the multiple interfaces of a domain and to establish associations between the interfaces and functions, based on a huge set…”
Získať plný text

Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size Autor Yin, Jian-Hua, Li, Jiong-Sheng

“…), Combinatorics, Graph Theory, and Algorithms, vol. 1, New Issues Press, Kalamazoo Michigan, 1999, pp. 451–460…”
Získať plný text

On Functional Module Detection in Metabolic Networks Autor Koch, Ina, Ackermann, Jörg

“… Metabolic networks can be studied also from the point of view of graph theory, and algorithms for graph decomposition have been applied for the identification of functional modules…”
Získať plný text

Biological Network Analysis: Trends, Approaches, Graphical Theory and Algorithms Autor Guzzi, Pietro Hiram, Roy, Swarup

“…Biological Network Analysis: Trends, Approaches, Graphical Theory and Algorithms considers three major biological networks, including Gene Regulatory Networks…”
Získať plný text

Graphic sequences with a realization containing a generalized friendship graph Autor Yin, Jian-Hua, Chen, Gang, Schmitt, John R.

“…), Combinatorics, Graph Theory and Algorithms, vol. I, New Issues Press, Kalamazoo, MI, 1999, pp…”
Získať plný text

Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete Autor Jiménez, Andrea, Schmidt, Tina Janne

“… Motivated by the great significance of grids in graph theory and algorithms due to the Grid-Minor Theorem by Robertson and Seymour, we investigate the computational complexity of the Grid TSC Problem in planar graphs…”
Získať plný text

On spanning 2-trees in a graph Autor Cai, Leizhen

“…A k-tree is either a complete graph on k vertices or a graph T that contains a vertex whose neighbourhood in T induces a complete graph on k vertices and whose…”
Získať plný text