Výsledky vyhledávání - Graph Theory—Graph algorithms Additional Key Words and Phrases
-
1
Autoři:
Zdroj: European Journal of Pure & Applied Mathematics; Oct2025, Vol. 18 Issue 4, p1-29, 29p
-
2
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, 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 Additional Key Words and Phrases, Distributed computing, rumor spreading, broadcasting, quasirandomness, random
Popis souboru: application/pdf
-
3
Autoři: a další
Zdroj: Discrete Dynamics in Nature & Society; 11/9/2025, Vol. 2025, p1-20, 20p
-
4
Autoři:
Přispěvatelé:
Témata: ics, Graph Theory--graph algorithms, network problems General Terms, Algorithms Additional Key Words and Phrases, Distributed algorithms, message communication, knot
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.9488; http://www.cs.utexas.edu/users/misra/scannedPdf.dir/KnotDetection.pdf
-
5
Autoři:
Přispěvatelé:
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
-
6
Autoři:
Přispěvatelé:
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
-
7
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algo- rithms and Problems—Computations on discrete structures, Routing and layout, G.1.6 [Numer- ical Analysis, Optimization— General Terms, Algorithms, Experimentation, Theory Additional Key Words and Phrases, Local Search, Feedback Arc Set, Approximation
Popis souboru: application/pdf
-
8
Autoři: a další
Přispěvatelé: a další
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
-
9
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, G.2.2 [Discrete Mathematics, Graph Theory—Graph labeling, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Design, Experimentation Additional Key Words and Phrases, Approximation algorithms, graph labeling
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.4836; http://www.dcc.unicamp.br/~fkm/publication/jea05.pdf
-
10
Autoři:
Přispěvatelé:
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
-
11
Autoři:
Přispěvatelé:
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
-
12
Autoři: a další
Přispěvatelé: a další
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
-
13
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors—compilers, 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, Languages, Performance, Theory Additional Key Words and Phrases, Compilers, dominators, flowgraphs, microtrees, path com
Popis souboru: application/pdf
-
14
Autoři:
Přispěvatelé:
Témata: Theory —graph algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Book embedding, graph genus. homotopy classes, planarnonplanar decomposition, surface
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.8958; http://cs.brown.edu/%7Esorin/pdfs/the%20pagenumber%20of%20genus%20g%20graphs%20is%20o.pdf
-
15
Autoři:
Přispěvatelé:
Témata: CR Categories and Subject Descriptors, C.2.4 [Computer-Communication Networks, Distributed Systems − distributed applications, G.2.2 [Discrete Mathematics, Graph Theory − graph algorithms, H.3.1 [Information Storage and Retrieval, Content Analysis and Indexing − abstracting methods, H.3.4 [Information Storage and Retrieval, Systems and Software − information networks, H.4.3 [Information Systems Applications, Communications Applications − bulletin boards, electronic mail, H.5.3 [Information Interfaces and Presentation, Group and Organization Interfaces − organizational design, I.5.2 [Pattern Recognition, Design Methodology − classifier design and evaluation, I.5.3 [Pattern Recognition, Clustering − algorithms, similarity measures, I.5.4 [Pattern Recognition, Applications, K.4.1 [Computers And Society, Public Policy Issues − privacy. General Terms, Design, Experimentation, Measurement Additional Key Words and Phrases, resource discovery
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.685; http://www.codeontheroad.com/papers/Email.Study.Paper.pdf
-
16
Autoři:
Přispěvatelé:
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, Theory Additional Key Words and Phrases, Approximate distance oracles, spanners, distance labelings, shortest paths
Popis souboru: application/pdf
-
17
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems-computations on discrete structures, G.2.1 [Discrete Mathematics, Graph Theory-graph algorithms, path and circuit problems General Terms, Algorithms, Network algorithms, Shortest paths Additional Key Words and Phrases, Functional complexity, time dependency, waiting times
Popis souboru: application/pdf
-
18
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems-computations on discrete structures, G.2.1 [Discrete Mathematics, Graph Theory-graph algorithms, path and circuit problems General Terms, Algorithms, Network algorithms, Shortest paths Additional Key Words and Phrases, Functional complexity, time dependency, waiting times
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.7997; http://cs.ucsb.edu/~suri/cs231/Rlist/ordaRom.pdf
-
19
Autoři:
Zdroj: Frontiers in Bioinformatics; 2025, p1-16, 16p
-
20
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Geometrical problems and computations, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Optimal triangulations, PLANAR 1-IN-3-SAT ACM Reference Format
Popis souboru: application/pdf
Full Text Finder 
Nájsť tento článok vo Web of Science 
Full Text