Výsledky vyhledávání - Graph Theory – Graph Algorithms. General Terms Algorithms*

Graphs for Pattern Recognition : Infeasible Systems of Linear Inequalities

Autoři: Damir Gainanov

Resource Type: eBook.

Témata: Inequalities (Mathematics), Graph theory

Categories: MATHEMATICS / Combinatorics, COMPUTERS / Image Processing, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Geometry / General, MATHEMATICS / Optimization

Knowledge Graphs and Big Data Processing

Autoři: Valentina Janev Damien Graux Hajira Jabeen a další

Resource Type: eBook.

Témata: Big data, Graph algorithms

Categories: COMPUTERS / Database Administration & Management, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Business & Productivity Software / General, COMPUTERS / Management Information Systems

Inexact Subgraph Matching Applied to Symbol Spotting in Graphical Documents

Autoři: Dutta, Anjan

Přispěvatelé: University/Department: Universitat Autònoma de Barcelona. Departament de Ciències de la Computació

Thesis Advisors: adutta@cvc.uab.es, Lladós Canet, Josep

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Subgraph mateling, Graph theory, Symbol spotting, Tecnologies

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/283518

Forbidden subgraphs in connected graphs

Autoři: Ravelomanana, Vlady Loÿs, Thimonier Laboratoire d'Informatique de Paris-Nord (LIPN) a další

Přispěvatelé: Ravelomanana, Vlady Loÿs, Thimonier Laboratoire d'Informatique de Paris-Nord (LIPN) a další

Zdroj: Theoretical Computer Science. 314:121-171

Témata: FOS: Computer and information sciences, Labelled graphs, triangle-free graphs, Discrete Mathematics (cs.DM), multivariate generating functions, Exact enumeration problems, generating functions, Random graphs (graph-theoretic aspects), 0102 computer and information sciences, enumerative combinatorics, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Enumeration in graph theory, 01 natural sciences, Combinatorial problems, forbidden subgraphs, Theoretical Computer Science, labelled graphs, asymptotic enumeration, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Computer Science - Data Structures and Algorithms, analytic combinatorics, FOS: Mathematics, Mathematics - Combinatorics, Theory, Data Structures and Algorithms (cs.DS), 0101 mathematics, Enumerative combinatorics, Triangle-free graphs, random graphs, Random graphs, Asymptotic enumeration, ACM Classification: G.2.1 Combinatorics G.2.2 Graph Theory General Terms: Algorithms, Combinatorics (math.CO), ACM Classification: G.2.1 Combinatorics G.2.2 Graph Theory General Terms: Algorithms, Theory, Multivariate generating functions, Analytic combinatorics, Computer Science(all), Computer Science - Discrete Mathematics

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/cs/0411093

Structure of conflict graphs in constrained alignment problems and algorithms.

Autoři: Alkan, Ferhat Bıyıkoğlu, Türker Demange, Marc a další

Zdroj: Discrete Mathematics & Theoretical Computer Science (DMTCS). 2019, Vol. 21 Issue 4, p1-30. 30p.

Témata: *GRAPH algorithms, *ALGORITHMS, *GRAPH theory, *BIOLOGICAL networks, *PROTEIN-protein interactions

Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Autoři: Monika R. Henzinger Valerie King The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Monika R. Henzinger Valerie King The Pennsylvania State University CiteSeerX Archives

Zdroj: http://infoscience.epfl.ch/record/99353/files/HenzingerK99.pdf.

Témata: Categories and Subject Descriptors, E.1 [Data, Data Structures—graphs and networks, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms General Terms, Algorithms

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.6807; http://infoscience.epfl.ch/record/99353/files/HenzingerK99.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.6807
http://infoscience.epfl.ch/record/99353/files/HenzingerK99.pdf

General Techniques for Analyzing Recursive Algorithms with Applications: General techniques for analyzing recursive algorithms with applications

Autoři: Rakesh M. Verma

Zdroj: SIAM Journal on Computing. 26:568-581

Témata: graph algorithms, recurrences, problem complexity, Analysis of algorithms and problem complexity, Pattern recognition, speech recognition, 0102 computer and information sciences, 01 natural sciences, analysis of algorithms, Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), associative-commutative (AC) matching, Graph theory (including graph drawing) in computer science, subtree isomorphism, Recurrences, divide-and-conquer, 0101 mathematics

Popis souboru: application/xml

(1 + ε )-SPANNER CONSTRUCTIONS FOR GENERAL GRAPHS.

Autoři: Elkin, Michael Peleg, David

Zdroj: SIAM Journal on Computing. 2004, Vol. 33 Issue 2, p608-631. 24p.

Témata: *GRAPH algorithms, *GRAPH theory, *GRAPHIC methods, *ALGORITHMS, *ALGEBRA

A dynamic topological sort algorithm for directed acyclic graphs

Autoři: David J. Pearce Paul H. J. Kelly The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: David J. Pearce Paul H. J. Kelly The Pennsylvania State University CiteSeerX Archives

Zdroj: http://wwwhomes.doc.ic.ac.uk/~phjk/Publications/DynamicTopoSortAlg-JEA-07.pdf.

Témata: Categories and Subject Descriptors, E.1 [Data Structures, Graphs and Networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms General Terms, Algorithms, Experimentation, Theory Additional Key Words and Phrases, Dynamic graph algorithms, topological sort

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.6117

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.6117
http://wwwhomes.doc.ic.ac.uk/~phjk/Publications/DynamicTopoSortAlg-JEA-07.pdf

The storage capacity of a directed graph and nodewise autonomous, ubiquitous learning.

Autoři: Hui Wei Fushun Li

Zdroj: Frontiers in Computational Neuroscience; 2023, p1-23, 23p

Témata: DIRECTED graphs, MACHINE learning, GRAPH algorithms, BIOLOGICAL neural networks, HOPFIELD networks, INFORMATION storage & retrieval systems, SELF-adaptive software

Finite-Horizon Optimal Control of Boolean Control Networks: A Unified Graph-Theoretical Approach.

Autoři: Gao, Shuhua Sun, Changkai Xiang, Cheng a další

Zdroj: IEEE Transactions on Neural Networks & Learning Systems; Jan2022, Vol. 33 Issue 1, p157-171, 15p

Témata: ESCHERICHIA coli, GRAPH theory, GRAPH algorithms, COMPUTATIONAL complexity, HORIZON

Fixed-parameter algorithms for minimum cost edge-connectivity augmentation

Autoři: Daniel Marx The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Daniel Marx The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.bme.hu/%7Edmarx/papers/marx-vegh-conn-talg.pdf.

Témata: G.2.1 [Discrete Mathematics, Graph Theory—Graph algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, fixed parameter algorithms, connectivity augmentation ACM Reference Format

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.701.7010

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.701.7010
http://www.cs.bme.hu/%7Edmarx/papers/marx-vegh-conn-talg.pdf

Building Connected Neighborhood Graphs for Isometric Data Embedding

Autoři: Li Yang The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Li Yang The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.uiuc.edu/class/fa05/cs591han/kdd05/docs/p722.pdf.

Témata: Categories and Subject Descriptors, H.2.8 [Database Management, Database Applications — Data mining, I.5.1 [Pattern Recognition, Models — Geometric, Statistical, G2.2 [Discrete Mathematics, Graph Theory — Graph algorithms General Terms, Algorithms, Experimentation Keywords, Data embedding, dimensionality reduction, manifold

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.2795; http://www.cs.uiuc.edu/class/fa05/cs591han/kdd05/docs/p722.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.2795
http://www.cs.uiuc.edu/class/fa05/cs591han/kdd05/docs/p722.pdf

Faster fixed parameter tractable algorithms for undirected feedback vertex set

Autoři: Venkatesh Raman Saket Saurabh C. R. Subramanian a další

Přispěvatelé: Venkatesh Raman Saket Saurabh C. R. Subramanian a další

Zdroj: http://www.imsc.res.in/~vraman/pub/talg_06_fvs.pdf.

Témata: Graph Theory—Graph algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Feedback vertex set, girth, parameterized complexity

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.8888; http://www.imsc.res.in/~vraman/pub/talg_06_fvs.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.8888
http://www.imsc.res.in/~vraman/pub/talg_06_fvs.pdf

Constant threshold intersection graphs of orthodox paths in trees.

Autoři: Bornstein, Claudson Ferreira Coura Pinto, José Wilson Rautenbach, Dieter a další

Zdroj: Discrete Applied Mathematics. Jul2020, Vol. 281, p61-68. 8p.

Témata: *INTERSECTION graph theory, *TREE graphs, *GRAPH algorithms, *PLANAR graphs, *COMPLETE graphs

The Role Graph Model and Conflict of Interest

Autoři: Matunda Nyanchama Sylvia Osborn The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Matunda Nyanchama Sylvia Osborn The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.aganoconsulting.com/matunda/wp-content/uploads/2006/12/p3-nyanchama.pdf.

Témata: Categories and Subject Descriptors, D.4.6 [Operating Systems, Security and Protection— access controls, K.6.5 [Management of Computing and Information Systems, Security and Protection, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms General Terms, Algorithms, Management, Security Additional Key Words and Phrases, role-based security, role graphs, conflict of interest

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.3734

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.3734
http://www.aganoconsulting.com/matunda/wp-content/uploads/2006/12/p3-nyanchama.pdf

Precise interprocedural dataflow analysis via graph reachability

Autoři: Thomas Reps Mooly Sagiv Susan Horwitz a další

Přispěvatelé: Thomas Reps Mooly Sagiv Susan Horwitz a další

Zdroj: http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.pdf.

Témata: CR Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors − compilers, optimization, E.1 [Data Structures] − graphs, F.2.2 [Analysis of Algorithms and Problem Complexity, Complexity of Algorithms, Nonnumerical Algorithms and Problems − computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory − graph algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, demand dataflow analysis, distributive dataflow framework, flow-sensitive side-effect analysis, function representation, graph reachability, interprocedural dataflow analysis, interprocedural program slicing, interprocedurally realizable path, interprocedurally valid path, meet-over-all-valid-paths solution

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.4141

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.4141
http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.pdf

Handling irreducible loops: Optimized node splitting vs. dj-graphs

Autoři: Sebastian Unger Frank Mueller The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Sebastian Unger Frank Mueller The Pennsylvania State University CiteSeerX Archives

Zdroj: http://moss.csc.ncsu.edu/~mueller/ftp/pub/mueller/papers/toplas2184.pdf.

Témata: Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors|compilers, optimization, E.1 [Data, Data Structures|graphs, G.2.2 [Discrete Mathematics, Graph Theory|graph algorithms General Terms, Algorithms, Languages Additional Key Words and Phrases, Compilation, control ow graphs, loops, irreducible ow- graphs, node splitting

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.470.3729; http://moss.csc.ncsu.edu/~mueller/ftp/pub/mueller/papers/toplas2184.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.470.3729
http://moss.csc.ncsu.edu/~mueller/ftp/pub/mueller/papers/toplas2184.pdf

What Energy Functions Can Be Minimized via graph Cuts?

Autoři: Kolmogorov, Vladimir Zabih, Ramin

Zdroj: IEEE Transactions on Pattern Analysis & Machine Intelligence; Feb2004, Vol. 26 Issue 2, p147-159, 13p, 2 Black and White Photographs, 4 Diagrams, 16 Charts

Témata: COMPUTER vision, MATHEMATICAL optimization, GRAPH algorithms, GRAPH theory, MARKOV random fields, RANDOM fields, ARTIFICIAL intelligence

An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA

Autoři: Eftihia Cayanis Peisen Zhang Susan C. Kistler a další

Zdroj: Bioinformatics. 10:309-317

Témata: Chromosome Walking, Chromosomes, Human, Pair 13, 0211 other engineering and technologies, Chromosome Mapping, Humans, Programming Languages, DNA, 0102 computer and information sciences, 02 engineering and technology, Cosmids, Sequence Alignment, 01 natural sciences, Algorithms

Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/7922688
https://europepmc.org/article/MED/7922688
https://doi.org/10.1093/bioinformatics/10.3.309
https://www.ncbi.nlm.nih.gov/pubmed/7922688
https://academic.oup.com/bioinformatics/article/10/3/309/216937
https://dblp.uni-trier.de/db/journals/bioinformatics/bioinformatics10.html#ZhangSFCWKB94