Fixed-parameter algorithms for minimum cost edge-connectivity augmentation

Συγγραφείς: Daniel Marx

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.bme.hu/%7Edmarx/papers/marx-vegh-conn-talg.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: 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

Finding a team of experts in social networks

Συγγραφείς: Kun Liu, Evimaria Terzi

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.ucr.edu/%7Etlappas/papers/team-formation.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.278.8013
http://www.cs.ucr.edu/%7Etlappas/papers/team-formation.pdf

Clone detection in automotive model-based development

Συγγραφείς: Florian Deissenboeck, Benjamin Hummel, Elmar Juergens, Bernhard Schätz, Stefan Wagner, Technische Universität München, Jean-françois Girard, Stefan Teuchert, Man Nutzfahrzeuge Ag

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www4.cs.tum.edu/~deissenb/publications/2008_deissenboeckf_model_clones.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

Clone Detection in Automotive Model-Based Development

Συγγραφείς: Florian Deissenboeck, Benjamin Hummel, Elmar Juergens, Bernhard Schätz, Stefan Wagner

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www4.informatik.tu-muenchen.de/~wagnerst/publ/icse08.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.5210
http://www4.informatik.tu-muenchen.de/~wagnerst/publ/icse08.pdf

Minimum-weight triangulation is NP-hard

Συγγραφείς: Wolfgang Mulzer, Günter Rote

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cse.yorku.ca/~andy/courses/6114/lecture-notes/MWT_NPhard.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.701
http://www.cse.yorku.ca/~andy/courses/6114/lecture-notes/MWT_NPhard.pdf

A dynamic topological sort algorithm for directed acyclic graphs

Συγγραφείς: David J. Pearce, Paul H. J. Kelly

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://wwwhomes.doc.ic.ac.uk/~phjk/Publications/DynamicTopoSortAlg-JEA-07.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: 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

Allocating indivisible goods

Συγγραφείς: Ivona Bezáková, Varsha Dani

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.sigecom.org/exchanges/volume_5/5.3-Bezakova.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.4975
http://www.sigecom.org/exchanges/volume_5/5.3-Bezakova.pdf

Approximate Distance Oracles

Συγγραφείς: MIKKEL THORUP, Uri Zwick

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://pdos.csail.mit.edu/~petar/behind/oracles-zwick-stoc01.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.333
http://pdos.csail.mit.edu/~petar/behind/oracles-zwick-stoc01.pdf

Building Connected Neighborhood Graphs for Isometric Data Embedding

Συγγραφείς: Li Yang

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.uiuc.edu/class/fa05/cs591han/kdd05/docs/p722.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

Allocating indivisible goods

Συγγραφείς: Ivona Bezáková, Varsha Dani

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://people.cs.uchicago.edu/~ivona/PAPERS/maxminfSIGecom.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.4316
http://people.cs.uchicago.edu/~ivona/PAPERS/maxminfSIGecom.pdf

On the impossibility of dimension reduction in ℓ1

Συγγραφείς: Bo Brinkman, Moses Charikar

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Θεματικοί όροι: on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Metric spaces, embedding, dimension reduction

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.193.3851

Faster fixed parameter tractable algorithms for undirected feedback vertex set

Συγγραφείς: Venkatesh Raman, Saket Saurabh, C. R. Subramanian

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.imsc.res.in/~vraman/pub/talg_06_fvs.pdf.

Θεματικοί όροι: Graph Theory—Graph algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Feedback vertex set, girth, parameterized complexity

Περιγραφή αρχείου: 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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.8888
http://www.imsc.res.in/~vraman/pub/talg_06_fvs.pdf

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

Συγγραφείς: Sebastian Unger, Frank Mueller

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://moss.csc.ncsu.edu/~mueller/ftp/pub/mueller/papers/toplas2184.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Συγγραφείς: Monika R. Henzinger, Valerie King

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://infoscience.epfl.ch/record/99353/files/HenzingerK99.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, E.1 [Data, Data Structures—graphs and networks, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms General Terms, Algorithms

Περιγραφή αρχείου: 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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.6807
http://infoscience.epfl.ch/record/99353/files/HenzingerK99.pdf

The Role Graph Model and Conflict of Interest

Συγγραφείς: Matunda Nyanchama, Sylvia Osborn

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.aganoconsulting.com/matunda/wp-content/uploads/2006/12/p3-nyanchama.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: 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

Identifying Loops In Almost Linear Time

Συγγραφείς: G. Ramalingam

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.research.ibm.com/people/r/rama/Papers/toplas99.ps.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.5381
http://www.research.ibm.com/people/r/rama/Papers/toplas99.ps

A new, simpler linear-time dominators algorithm

Συγγραφείς: Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. West

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://adambuchsbaum.com/papers/dom-toplas.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.574.2152
http://adambuchsbaum.com/papers/dom-toplas.pdf

Precise interprocedural dataflow analysis via graph reachability

Συγγραφείς: Thomas Reps, Mooly Sagiv, Susan Horwitz

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.4141
http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.pdf

Precise interprocedural dataflow analysis via graph reachability

Συγγραφείς: Thomas Reps, Mooly Sagiv, Susan Horwitz

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.ps.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/postscript

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.2375
http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.ps

On the Complexity of Branching Programs and Decision Trees for Clique Functions

Συγγραφείς: Ingo Wegener

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.helsinki.fi/u/vvnurmi/tiki/pdf/wegener-on-the-complexity-of-branching-programs-and-decision-trees-for-clique-functions.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.5071
http://www.cs.helsinki.fi/u/vvnurmi/tiki/pdf/wegener-on-the-complexity-of-branching-programs-and-decision-trees-for-clique-functions.pdf