Search Results - G.2.2 [Discrete Mathematics]: Graph Theory-Graph Algorithms
-
1
Authors:
Source: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977073
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Probability (math.PR), SPECTRAL GRAPH THEORY, GRAPH SPARSIFICATION, EXPANDER GRAPHS, G.2.1, G.2.2, 0102 computer and information sciences, 01 natural sciences, F.2.0, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), 0101 mathematics, Mathematics - Probability, Computer Science - Discrete Mathematics
File Description: application/pdf
-
2
Authors:
Contributors:
Subject Terms: 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
File Description: application/pdf
-
3
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, E.1 [Data, Data Structures—graphs and networks, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms General Terms, Algorithms
File Description: 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
-
4
Authors:
Contributors:
Subject Terms: Combinatorial Optimisation, Graph Algorithms, Approximation Algorithms, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8615; http://arxiv.org/pdf/cs/0604020v2.pdf
-
5
Authors:
Contributors:
Subject Terms: 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
File Description: application/pdf
-
6
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: 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
-
7
Authors: et al.
Contributors: et al.
Source: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)
https://hal.science/hal-00587955
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 4 pSubject Terms: small worlds, social networks, peer-to-peer networks, decentralized search, optimal paths, \category{F.2.2}{Nonnumerical Algorithms and Problems}{Routing and layout} \category{E.1}{Data Structures}{Graphs and networks} \category{G.2.2}{Graph Theory}{Graph algorithms, Network problems} \category{C.2.2}{Network Protocols}{Routing protocols}, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [SHS.SOCIO]Humanities and Social Sciences/Sociology
Subject Geographic: Cap Estérel, France
-
8
Authors:
Contributors:
Subject Terms: 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
File Description: application/pdf
-
9
Authors:
Contributors:
Subject Terms: 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
File Description: 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
-
10
Authors: et al.
Source: SSRN Electronic Journal
Subject Terms: Sciences informatiques, Business & economic sciences, Goodness-of-fit measures, Economics, G.2.2 [discrete mathematics]: graph theory - graph algorithms, 16. Peace & justice, Computer science, Engineering, computing & technology, Ingénierie, informatique & technologie, Computational complexity, Revealed preference, Testing individual rationality, Microéconomie, Economie, Microeconomics, Sciences économiques & de gestion, Algorithms, F.2.0 [analysis of algorithms and problem complexity]: general, NP-complete
File Description: No full-text files; 1 full-text file(s): application/pdf
Access URL: https://lirias.kuleuven.be/bitstream/123456789/359169/1/KBI_1222.pdf
https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/162939/Details
https://orbi.uliege.be/handle/2268/206625
http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_11.pdf
https://dl.acm.org/doi/10.1145/2560793
https://dblp.uni-trier.de/db/journals/teco/teco2.html#SmeuldersSCR14
https://papers.ssrn.com/sol3/Delivery.cfm/SSRN_ID2165766_code444941.pdf?abstractid=2165766&mirid=3
https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2165766
https://lirias.kuleuven.be/handle/123456789/359169
https://hdl.handle.net/2268/206625
https://doi.org/10.1145/2560793
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/132527 -
11
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: application/pdf
-
12
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: application/pdf
-
13
Authors:
Contributors:
Subject Terms: 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
File Description: 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
-
14
Authors:
Contributors:
Subject Terms: Combinatorial Optimization, Graph Algorithms, Approximation Algorithms, Inapproximability, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and circuit problems
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.4448; http://arxiv.org/pdf/cs/0609103v2.pdf
-
15
Authors:
Contributors:
Subject Terms: Combinatorial Optimization, Graph Algorithms, Approximation Algorithms, Inapproximability, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and circuit problems
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.3691; http://arxiv.org/pdf/cs/0609103v1.pdf
-
16
Authors:
Contributors:
Subject Terms: 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, Graph Theory—network problems General Terms Algorithms, Theory Keywords capacities, dominating sets, distributed approximation
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.9798; http://www.cadmo.ethz.ch/as/people/alumni/fkuhn/pubs/spaa07b.pdf
-
17
Authors: et al.
Contributors: et al.
Subject Terms: 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, Graph Theory—network problems General Terms Algorithms, Theory Keywords Data Aggregation, Distributed Algorithms, In-Network Aggregation, Median, Time Complexity, Sensor Networks
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.6192; http://www.tik.ee.ethz.ch/file/5a15f565006b60eac7b39b7e61885879/spaa07.pdf
-
18
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors D.3.3 [Programming Languages, Language Con- structs and Features — Control structures, D.3.4 [Programming Languages, Proces- sors — Compilers, F.4.2 [Mathematical Logic and Formal Languages, Grammars and Other Rewriting Systems —, G.2.2 [Discrete Mathematics, Graph Theory — Graph algorithms, F.1.2 [Computation by Abstract Devices, Modes of Computation — Alternation and nondeterminism, General Terms Languages, Non-Determinism, Graph, Rewriting, Compilation. Keywords Functional Logic Programming Languages, Graph Rewriting Systems, Compiler Construction
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.1466; http://web.cecs.pdx.edu/%7Eantoy/homepage/publications/lopstr13/long.pdf
-
19
Authors: et al.
Contributors: et al.
Subject Terms: G.2.2 [Discrete Mathematics, Graph Theory graph algorithms, Graph Theory network problems General Terms Algorithms, Theory Keywords Aggregation, Distributed Algorithms, Mode, Most Frequent Element
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.3839; http://people.csail.mit.edu/fkuhn/publications/podc08a.pdf
-
20
Authors: et al.
Contributors: et al.
Source: http://www-lehre.inf.uos.de/theoinf/lib/exe/fetch.php/pubs/pacvis08_preprint_simultdrawcrno_pdf.pdf.
Subject Terms: Simultaneous Graph Drawing, Crossing Number, NPcompleteness, Algorithms, Branch-and-Cut Index Terms, G.2.2 [Discrete Mathematics, Graph Theory— Graph algorithms, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Routing
File Description: application/pdf
Nájsť tento článok vo Web of Science