Výsledky vyhledávání - "Graph Theory—Graph algorithms General Terms"
-
1
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
-
2
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors H.2.8 [Database Management, Database Applications— Data mining, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms General Terms Algorithms, Experimentation, Theory Keywords team formation
Popis souboru: application/pdf
-
3
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors D.2.13 [Software Engineering, Reusable Software—Re- usable libraries, Reuse models, G.2.2 [Discrete Mathe- matics, Graph Theory—Graph algorithms General Terms Algorithms, Design, Experimentation, Measurement Keywords Clone detection, model clone, Matlab/Simulink, data-flow
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.631.1446; http://www4.cs.tum.edu/~deissenb/publications/2008_deissenboeckf_model_clones.pdf
-
4
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors D.2.13 [Software Engineering, Reusable Software—Reusable libraries, Reuse models, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms General Terms Algorithms, Design, Experimentation, Measurement Keywords Clone detection, model clone, Matlab/Simulink, data-flow
Popis souboru: application/pdf
-
5
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
-
6
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
-
7
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.2.1 [Discrete Mathematics, Combinatorics – Combinatorial Algorithms, G.2.2 [Discrete Mathematics, Graph Theory – Graph Algorithms General Terms, Algorithms, Economics, Theory Additional Key Words and Phrases, Approximation Algorithms, Cake-cutting, Fairness, Game Theory, Truthfulness
Popis souboru: application/pdf
-
8
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
-
9
Autoři:
Přispěvatelé:
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
-
10
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.2.1 [Discrete Mathematics, Combinatorics – Combinatorial Algorithms, G.2.2 [Discrete Mathematics, Graph Theory – Graph Algorithms General Terms, Algorithms, Economics, Theory Additional Key Words and Phrases, Approximation Algorithms, Cake-cutting, Fairness, Game Theory, Truthfulness
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.4316; http://people.cs.uchicago.edu/~ivona/PAPERS/maxminfSIGecom.pdf
-
11
-
12
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
-
13
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
-
14
Autoři:
Přispěvatelé:
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
-
15
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
-
16
Autoři:
Přispěvatelé:
Témata: ers, optimization, E.1 [Data, Data Structures---graphs, trees, G.2.2 [Discrete Mathematics, Graph Theory---graph algorithms General Terms, Algorithms, Languages Additional Key Words and Phrases, loops, irreducible flowgraphs
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.5381; http://www.research.ibm.com/people/r/rama/Papers/toplas99.ps
-
17
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
-
18
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
-
19
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/postscript
-
20
Autoři:
Přispěvatelé:
Témata: hierarchies, 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, Verification Additional Key Words and Phrases, Branching programs, clique functions, decision trees, lower bounds
Popis souboru: application/pdf
Nájsť tento článok vo Web of Science