Výsledky vyhľadávania - Graph Theory—Network problems General Terms Algorithms*

Faster algorithms for the shortest path problem

Autori: Ravindra K. Ahuja Kurt Mehlhorn James B. Orlin a ďalší

Prispievatelia: Ravindra K. Ahuja Kurt Mehlhorn James B. Orlin a ďalší

Zdroj: http://jorlin.scripts.mit.edu/docs/publications/32-faster algorithms shortest.pdf.

Predmety: Categories and Subject Descriptors, G.2.2 [Discrete Mathematics, Graph Theory-network problems General Terms, Algorithms, Design, Theory Additional Key Words and Phrases, Heap, priority queue, shortest paths

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.4609
http://jorlin.scripts.mit.edu/docs/publications/32-faster algorithms shortest.pdf

An Approximate König's Theorem for Edge-Coloring Weighted Bipartite Graphs (Extended Abstract)

Autori: José R. Correa Michel X. Goemans The Pennsylvania State University CiteSeerX Archives

Prispievatelia: José R. Correa Michel X. Goemans The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www-math.mit.edu/~goemans/clos.pdf.

Predmety: Categories and Subject Descriptors F.2.m [Analysis of Algorithms and Problem Complexity, Miscellaneous, G.2.2 [Discrete Mathematics, Graph Theory—Network Problems General Terms Algorithms and Theory Keywords Bipartite Edge Coloring, Rearrangeability of 3-Stage Clos Networks, Bin Packing

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.8457
http://www-math.mit.edu/~goemans/clos.pdf

A Novel Bondage Parameter for Network Analysis.

Autori: Tuncel Golpek, Hande

Zdroj: Symmetry (20738994); Aug2025, Vol. 17 Issue 8, p1170, 18p

Predmety: GRAPH theory, SENSITIVITY analysis, COMPUTER networks, OPTIMIZATION algorithms

Modelling and algorithms of highway transportation network in urban agglomerations.

Autori: Wang, Shuoqi Wang, Zhanzhong

Zdroj: Scientific Reports; 8/1/2025, Vol. 15 Issue 1, p1-18, 18p

Predmety: URBAN transportation, OPTIMIZATION algorithms, AUTOMOTIVE transportation, INFRASTRUCTURE (Economics), TRANSPORTATION corridors, ROUTE choice, METROPOLITAN areas

T.: Distributed approximation of capacitated dominating sets

Autori: Fabian Kuhn Thomas Moscibroda The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Fabian Kuhn Thomas Moscibroda The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cadmo.ethz.ch/as/people/alumni/fkuhn/pubs/spaa07b.pdf.

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

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

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

Tight Bounds for Distributed Selection

Autori: Fabian Kuhn Thomas Locher Roger Wattenhofer a ďalší

Prispievatelia: Fabian Kuhn Thomas Locher Roger Wattenhofer a ďalší

Zdroj: http://www.tik.ee.ethz.ch/file/5a15f565006b60eac7b39b7e61885879/spaa07.pdf.

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

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.6192
http://www.tik.ee.ethz.ch/file/5a15f565006b60eac7b39b7e61885879/spaa07.pdf

Distributed computation of the mode

Autori: Fabian Kuhn Thomas Locher Stefan Schmid a ďalší

Prispievatelia: Fabian Kuhn Thomas Locher Stefan Schmid a ďalší

Zdroj: http://people.csail.mit.edu/fkuhn/publications/podc08a.pdf.

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

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.3839
http://people.csail.mit.edu/fkuhn/publications/podc08a.pdf

A Survey on the Densest Subgraph Problem and its Variants.

Autori: Lanciano, Tommaso Miyauchi, Atsushi Fazzone, Adriano a ďalší

Zdroj: ACM Computing Surveys; Aug2024, Vol. 56 Issue 8, p1-40, 40p

Predmety: COLUMN generation (Algorithms), DISCRETE mathematics, SUBMODULAR functions, MATHEMATICAL programming, BENFORD'S law (Statistics), APPROXIMATION algorithms, DIRECTED graphs, BIPARTITE graphs

Constructing Fault-Tolerant Overlay Networks for Topic-based Publish/Subscribe

Autori: Chen Chen Roman Vitenberg Hans-Arno Jacobsen a ďalší

Prispievatelia: Chen Chen Roman Vitenberg Hans-Arno Jacobsen a ďalší

Zdroj: http://msrg.org/publications/pdf_files/2013/PODC13_kTCO-Brief_Announcement:_Constructing_.pdf.

Predmety: Categories and Subject Descriptors C.2.1 [Computer-Communication Networks, Network ArchitectureandDesign—network topology, G.2.2[Discrete Mathematics, Graph Theory—network problems General Terms Algorithms, Theory, Experimentation Keywords Overlay networks, reliability, publish/subscribe

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.4205
http://msrg.org/publications/pdf_files/2013/PODC13_kTCO-Brief_Announcement:_Constructing_.pdf

Simple sybil-proof mechanisms for multi-level marketing. www.cs.dartmouth.edu/ druckerf/papers/sybil-abstract.pdf

Autori: Fabio A. Drucker Lisa K. Fleischer Dartmouth College a ďalší

Prispievatelia: Fabio A. Drucker Lisa K. Fleischer Dartmouth College a ďalší

Zdroj: http://www.cs.dartmouth.edu/~lkf/papers/fabio-ec12.pdf.

Predmety: Categories and Subject Descriptors, J.4 [Social and Behavioral Sciences, Economics, G.2.2 [Discrete Mathematics, Graph Theory—Network problems General Terms, Algorithms, Economics Additional Key Words and Phrases, Mechanism design, Recommender systems, Social networks

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.1601
http://www.cs.dartmouth.edu/~lkf/papers/fabio-ec12.pdf

Information gathering in adversarial systems: Lines and cycles

Autori: Kishore Kothapalli Christian Scheideler The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Kishore Kothapalli Christian Scheideler The Pennsylvania State University CiteSeerX Archives

Zdroj: http://cstar.iiit.ac.in/~kkishore/gather-spaa.pdf.

Predmety: Categories and Subject Descriptors F.2.8 [Analysis of Algorithms and Problem Complexity, Non- numerical Algorithms and Problems—Routing and layout, G.2.2 [Discrete Mathematics, Graph Theory—Network problems General Terms

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.560.9619
http://cstar.iiit.ac.in/~kkishore/gather-spaa.pdf

Energy efficient routing with adaptive data fusion in sensor networks

Autori: Hong Luo Jun Luo Yonghe Liu a ďalší

Prispievatelia: Hong Luo Jun Luo Yonghe Liu a ďalší

Zdroj: http://ranger.uta.edu/~yonghe/pubs/Adaptive_Fusion_Conf.pdf.

Predmety: C.2.2 [Computer-communication networks, Network Protocols— Routing Protocols, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Routing and layout, G.2.2 [Discrete Mathematics, Graph Theory—Network problems General Terms Algorithms, Theory Keywords Sensor networks, data gathering, data fusion, routing

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.5923; http://ranger.uta.edu/~yonghe/pubs/Adaptive_Fusion_Conf.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.5923
http://ranger.uta.edu/~yonghe/pubs/Adaptive_Fusion_Conf.pdf

Lattice Sensor Networks: Capacity Limits, Optimal Routing and Robustness to Failures

Autori: Guillermo Barrenechea Baltasar Beferull-lozano Martin Vetterli a ďalší

Prispievatelia: Guillermo Barrenechea Baltasar Beferull-lozano Martin Vetterli a ďalší

Zdroj: http://ce.sharif.ac.ir/~ghodsi/archive/Course-Materials/Advanced Algorithms/papers/Sensor Neworks/Lattice Sensor Networks Capacity Limits,Optimal.pdf.

Predmety: Categories and Subject Descriptors C.2.1 [Computer-Communication Networks, Network Architecture and Design—Store and forward networks, C.2.2 [Computer-Communication Networks, Network Protocols—Routing protocols, G.2.2 [Discrete Mathematics, Graph Theory—Network problems General Terms Algorithms, Performance, Theory

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.4843
http://ce.sharif.ac.ir/~ghodsi/archive/Course-Materials/Advanced Algorithms/papers/Sensor Neworks/Lattice Sensor Networks Capacity Limits,Optimal.pdf

Dynamic analysis of the arrow distributed protocol

Autori: Fabian Kuhn Roger Wattenhofer The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Fabian Kuhn Roger Wattenhofer The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.tik.ee.ethz.ch/file/519288792b5c3f2a4cf57cc159709508/spaa04.pdf.

Predmety: G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, Graph Theory—network problems General Terms Algorithms, Theory Keywords Distributed Queuing, Distributed Ordering, Competitive Analysis, Distributed Algorithms

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.8275; http://www.tik.ee.ethz.ch/file/519288792b5c3f2a4cf57cc159709508/spaa04.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.8275
http://www.tik.ee.ethz.ch/file/519288792b5c3f2a4cf57cc159709508/spaa04.pdf

Construction of resilient and sustainable supply chain based on multilayer Bayesian network.

Autori: Lu, Jie Wu, Desheng Dolgui, Alexandre

Zdroj: International Journal of Production Research; Dec2025, Vol. 63 Issue 23, p8984-9008, 25p

Applications, challenges, and solutions to single- and multi-objective critical node detection problems: a survey.

Autori: Megzari, Abdelmoujib Pravija Raj, P. V. Osamy, Walid a ďalší

Zdroj: Journal of Supercomputing; Nov2023, Vol. 79 Issue 17, p19770-19808, 39p

Predmety: NETWORK performance, RESEARCH personnel, EVOLUTIONARY algorithms

Inertial Residual Projection Method (IRPM) for Approximating Solutions of Variational Inequality Problems.

Autori: EKUMA-OKEREKE, E. OKUDU, G.

Zdroj: FUPRE Journal of Scientific & Industrial Research; 2025, Vol. 9 Issue 3, p21-38, 18p

Predmety: LINEAR operators, HILBERT space, CONVEX functions, PRIOR learning, EXTRAPOLATION

Simultaneous Stabilization of a Family of Linear Dynamic Plants.

Autori: Fursov, A. S.

Zdroj: Differential Equations; 2024 Suppl 1, Vol. 60, p1-143, 143p

Predmety: DYNAMIC stability, FAMILIES, CLASSIFICATION

Towards Efficient and Accurate Network Exposure Surface Analysis for Enterprise Networks.

Autori: Wang, Zhihua Jin, Minghui Hu, Youlin a ďalší

Zdroj: Electronics (2079-9292); Jun2025, Vol. 14 Issue 12, p2409, 20p

Predmety: SEARCH algorithms, PARALLEL algorithms, COMPUTER network security, SURFACE analysis, ALGORITHMS

Equilibrium analysis for multi-defender Stackelberg security games under a logit tie-breaking rule.

Autori: Chen, Ling Li, Mingchu

Zdroj: Journal of Control & Decision; Oct2024, Vol. 11 Issue 4, p669-677, 9p

Predmety: NASH equilibrium, EQUILIBRIUM, ALGORITHMS, MOTIVATION (Psychology), GAMES