Výsledky vyhľadávania - Graph Theory|graph algorithms General Terms

Graphs for Pattern Recognition : Infeasible Systems of Linear Inequalities

Autori: Damir Gainanov

Typ zdroja: eBook.

Predmet: Inequalities (Mathematics), Graph theory

Kategórie: MATHEMATICS / Combinatorics, COMPUTERS / Image Processing, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Geometry / General, MATHEMATICS / Optimization

Knowledge Graphs and Big Data Processing

Autori: Valentina Janev Damien Graux Hajira Jabeen a ďalší

Typ zdroja: eBook.

Predmet: Big data, Graph algorithms

Kategórie: 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

Autori: Dutta, Anjan

Prispievatelia: 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)

Predmety: Subgraph mateling, Graph theory, Symbol spotting, Tecnologies

Popis súboru: application/pdf

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

Forbidden subgraphs in connected graphs

Autori: Ravelomanana, Vlady Loÿs, Thimonier Laboratoire d'Informatique de Paris-Nord (LIPN) a ďalší

Prispievatelia: Ravelomanana, Vlady Loÿs, Thimonier Laboratoire d'Informatique de Paris-Nord (LIPN) a ďalší

Zdroj: Theoretical Computer Science. 314:121-171

Predmety: 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 súboru: application/xml

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

A dynamic topological sort algorithm for directed acyclic graphs

Autori: David J. Pearce Paul H. J. Kelly The Pennsylvania State University CiteSeerX Archives

Prispievatelia: 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.

Predmety: 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 súboru: application/pdf

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

Dostupnosť: 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

An Elementary Introduction to Graph Theory

Autori: Alexander Lokshin

Predmety: 4. Education

$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs: \((1+\varepsilon,\beta)\)-spanner constructions for general graphs

Autori: David Peleg Michael Elkin

Zdroj: SIAM Journal on Computing. 33:608-631

Predmety: graph algorithms, spanners, Distance in graphs, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, graph partitions, 0102 computer and information sciences, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/2135785
https://doi.org/10.1137/s0097539701393384
https://dl.acm.org/doi/10.1137/S0097539701393384
https://epubs.siam.org/doi/10.1137/S0097539701393384
https://locus.siam.org/doi/abs/10.1137/S0097539701393384
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp33.html#ElkinP04

Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Autori: Monika R. Henzinger Valerie King The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Monika R. Henzinger Valerie King The Pennsylvania State University CiteSeerX Archives

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

Predmety: 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 súboru: 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

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

Structure of conflict graphs in constrained alignment problems and algorithms.

Autori: Alkan, Ferhat Bıyıkoğlu, Türker Demange, Marc a ďalší

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

Predmety: *GRAPH algorithms, *ALGORITHMS, *GRAPH theory, *BIOLOGICAL networks, *PROTEIN-protein interactions

Building Connected Neighborhood Graphs for Isometric Data Embedding

Autori: Li Yang The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Li Yang The Pennsylvania State University CiteSeerX Archives

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

Predmety: 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 súboru: 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

Dostupnosť: 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

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

Autori: Hui Wei Fushun Li

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

Predmety: 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.

Autori: Gao, Shuhua Sun, Changkai Xiang, Cheng a ďalší

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

Predmety: ESCHERICHIA coli, GRAPH theory, GRAPH algorithms, COMPUTATIONAL complexity, HORIZON

Modelling Hierarchical Structures in Networks Using Graph Theory : With Application to Knowledge Networks in Graph Curricula

Autori: Wengle, Emil

Témy: community detection, graph theory, modularity, higher education, Computer and Information Sciences, Data- och informationsvetenskap, Student thesis, info:eu-repo/semantics/bachelorThesis, text

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-415044
UPTEC F, 1401-5757 ; 20038

Constant threshold intersection graphs of orthodox paths in trees.

Autori: Bornstein, Claudson Ferreira Coura Pinto, José Wilson Rautenbach, Dieter a ďalší

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

Predmety: *INTERSECTION graph theory, *TREE graphs, *GRAPH algorithms, *PLANAR graphs, *COMPLETE graphs

The Role Graph Model and Conflict of Interest

Autori: Matunda Nyanchama Sylvia Osborn The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Matunda Nyanchama Sylvia Osborn The Pennsylvania State University CiteSeerX Archives

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

Predmety: 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 súboru: application/pdf

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

Dostupnosť: 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

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

Autori: Sebastian Unger Frank Mueller The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Sebastian Unger Frank Mueller The Pennsylvania State University CiteSeerX Archives

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

Predmety: 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 súboru: 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

Dostupnosť: 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

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

Autori: Rakesh M. Verma

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

Predmety: 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 súboru: application/xml

Precise interprocedural dataflow analysis via graph reachability

Autori: Thomas Reps Mooly Sagiv Susan Horwitz a ďalší

Prispievatelia: Thomas Reps Mooly Sagiv Susan Horwitz a ďalší

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

Predmety: 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 súboru: application/pdf

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

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

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

Autori: Eftihia Cayanis Peisen Zhang Susan C. Kistler a ďalší

Zdroj: Bioinformatics. 10:309-317

Predmety: 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

Prí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

Fixed-parameter algorithms for minimum cost edge-connectivity augmentation

Autori: Daniel Marx The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Daniel Marx The Pennsylvania State University CiteSeerX Archives

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

Predmety: 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 súboru: application/pdf

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

Dostupnosť: 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