作者: Agronomy 時(shí)間: 2025-3-21 23:03
Situative Content-Marketing-Strategieall possible scenarios is minimized. We propose an . time algorithm for the minimax regret 1-median problem in dynamic path networks with uniform capacity, where . is the number of vertices in the network.作者: 東西 時(shí)間: 2025-3-22 01:19
Evangelism in Social Networks number of . individuals? We prove that the problem is hard to solve, even in an approximate sense, and we present exact polynomial time algorithms for trees and complete graphs. For general graphs, we derive exact algorithms parameterized with respect to neighborhood diversity. We also study the pr作者: 瘋狂 時(shí)間: 2025-3-22 08:13
Minimax Regret 1-Median Problem in Dynamic Path Networksall possible scenarios is minimized. We propose an . time algorithm for the minimax regret 1-median problem in dynamic path networks with uniform capacity, where . is the number of vertices in the network.作者: EXTOL 時(shí)間: 2025-3-22 11:29 作者: Lipoprotein 時(shí)間: 2025-3-22 16:46
https://doi.org/10.1007/978-3-322-94990-5a color to each incoming vertex . so that the revealed graph is properly colored. The exact location of . in the graph . is not known to the algorithm, since it sees only previously colored neighbors of .. The . of . is the smallest number of colors such that some online algorithm is able to properl作者: Lipoprotein 時(shí)間: 2025-3-22 20:47 作者: 枯萎將要 時(shí)間: 2025-3-22 22:22
Zur Konstruktion von Wirklichkeitening that when two disks touch, the one with lower priority is ‘crushed’. A straightforward algorithm has running time . which we improve to expected . where . is the ratio between largest and smallest radii amongst the disks. For a very natural application of this problem in the map rendering domain作者: assent 時(shí)間: 2025-3-23 02:45 作者: 入會(huì) 時(shí)間: 2025-3-23 05:49
Anl?sse für Situationskl?rungentite graph . contains a non-crossing spanning tree whose maximum degree is at most .; this is the best possible upper bound on the maximum degree. This solves an open problem posed by Abellanas . at the Graph Drawing Symposium, 1996.作者: anachronistic 時(shí)間: 2025-3-23 10:36 作者: DUCE 時(shí)間: 2025-3-23 17:55
Situative Content-Marketing-Strategieime-dependent) categories: ., and .. A dynamical process of information diffusion evolves among the individuals of the population according to the following rules. Initially, all individuals are agnostic. Then, a set of people is chosen from the outside and convinced to start evangelizing, i.e., to 作者: deceive 時(shí)間: 2025-3-23 18:16 作者: 朦朧 時(shí)間: 2025-3-24 02:06 作者: ELUC 時(shí)間: 2025-3-24 02:25
Situative Content-Marketing-Strategiede a polynomial delay algorithm. We give bounds on the number of maximal chain subgraphs for a bipartite graph and use them to establish the input-sensitive complexity of the enumeration problem. The second problem we treat is the one of finding the minimum number of chain subgraphs needed to cover 作者: Notorious 時(shí)間: 2025-3-24 08:28
Situative Content-Marketing-Strategiend no . consecutive persons are of the same gender. While the case of . corresponds to the classical . with a well-studied solution, no closed-form expression for the number of seating arrangements is known when ...We propose a novel approach for this type of problems based on enumeration of walks i作者: 混合,攙雜 時(shí)間: 2025-3-24 13:38
https://doi.org/10.1007/978-3-658-34328-6ansforms a given Steiner tree into another one by exchanging a single edge at a time. In this paper, we show that the problem is PSPACE-complete even for split graphs (and hence for chordal graphs), while solvable in linear time for interval graphs.作者: Chromatic 時(shí)間: 2025-3-24 17:07
https://doi.org/10.1007/978-3-658-34328-6or rejected, and the aim is to either minimize or maximize the number of accepted requests, while maintaining a feasible solution. All .-complete problems (including Independent Set, Vertex Cover, Dominating Set, and Set Cover) have essentially the same advice complexity. In this paper, we study wei作者: 招惹 時(shí)間: 2025-3-24 22:54 作者: Synthesize 時(shí)間: 2025-3-25 01:49
Plane Bichromatic Trees of Low Degreetite graph . contains a non-crossing spanning tree whose maximum degree is at most .; this is the best possible upper bound on the maximum degree. This solves an open problem posed by Abellanas . at the Graph Drawing Symposium, 1996.作者: 大包裹 時(shí)間: 2025-3-25 06:40 作者: gerrymander 時(shí)間: 2025-3-25 10:39 作者: Feedback 時(shí)間: 2025-3-25 13:15 作者: 確認(rèn) 時(shí)間: 2025-3-25 16:00
Anl?sse für Situationskl?rungentite graph . contains a non-crossing spanning tree whose maximum degree is at most .; this is the best possible upper bound on the maximum degree. This solves an open problem posed by Abellanas . at the Graph Drawing Symposium, 1996.作者: PAN 時(shí)間: 2025-3-26 00:03
https://doi.org/10.1007/978-3-658-34328-6ansforms a given Steiner tree into another one by exchanging a single edge at a time. In this paper, we show that the problem is PSPACE-complete even for split graphs (and hence for chordal graphs), while solvable in linear time for interval graphs.作者: 我正派 時(shí)間: 2025-3-26 03:45 作者: 鐵砧 時(shí)間: 2025-3-26 04:58 作者: 使成整體 時(shí)間: 2025-3-26 10:20
https://doi.org/10.1007/978-3-319-44543-4approximation algorithms; data structures; dynamic programming; graph algorithms; social networks; algori作者: 口味 時(shí)間: 2025-3-26 15:06
978-3-319-44542-7Springer International Publishing Switzerland 2016作者: 宇宙你 時(shí)間: 2025-3-26 18:25
On the Complexity of Computing Treebreadthn are the maximum diameter and radius of its bags respectively. The . and the . of a graph are the minimum length and breadth of its tree-decompositions respectively. . and . are defined similarly for path-decompositions. In this paper, we answer open questions of [Dragan and K?hler, Algorithmica 20作者: cacophony 時(shí)間: 2025-3-27 00:29
Online Chromatic Number is PSPACE-Completea color to each incoming vertex . so that the revealed graph is properly colored. The exact location of . in the graph . is not known to the algorithm, since it sees only previously colored neighbors of .. The . of . is the smallest number of colors such that some online algorithm is able to properl作者: 思想 時(shí)間: 2025-3-27 04:19
Bounded Embeddings of Graphs in the Plane the projection to the .-axis. We prove a characterization of isotopy classes of embeddings of connected graphs equipped with . in the plane containing an .-bounded embedding. Then we present an efficient algorithm, which relies on our result, for testing the existence of an .-bounded embedding if t作者: Hallmark 時(shí)間: 2025-3-27 08:54 作者: gait-cycle 時(shí)間: 2025-3-27 11:43 作者: 灌溉 時(shí)間: 2025-3-27 17:16
Plane Bichromatic Trees of Low Degreetite graph . contains a non-crossing spanning tree whose maximum degree is at most .; this is the best possible upper bound on the maximum degree. This solves an open problem posed by Abellanas . at the Graph Drawing Symposium, 1996.作者: syring 時(shí)間: 2025-3-27 18:33
Directing Road Networks by Listing Strong Orientations direction each, so that every node can reach any other [Robbins ’39]. Using .(.) preprocessing time and space usage, it is shown that all feasible directions can be found in .(.) amortized time each. To do so, we give a new algorithm that lists all the strong orientations of an undirected connected作者: Anemia 時(shí)間: 2025-3-28 01:15
Evangelism in Social Networksime-dependent) categories: ., and .. A dynamical process of information diffusion evolves among the individuals of the population according to the following rules. Initially, all individuals are agnostic. Then, a set of people is chosen from the outside and convinced to start evangelizing, i.e., to 作者: 光滑 時(shí)間: 2025-3-28 04:03
Distance Queries in Large-Scale Fully Dynamic Complex Networkshortest-path distance queries on large-scale networks. In this paper, we propose the first dynamic algorithm to update 2-hop cover labelings for distance queries under edge removals, and show that: (i) it is efficient in terms of the number of nodes that change their distance toward some other node 作者: GRACE 時(shí)間: 2025-3-28 07:08
Minimax Regret 1-Median Problem in Dynamic Path Networksundirected path with positive edge lengths, uniform positive edge capacity, and nonnegative vertex supplies. Here, each vertex supply is unknown but only an interval of supply is known. A particular assignment of supply to each vertex is called a .. Given a scenario . and a sink location . in a dyna作者: 強(qiáng)壯 時(shí)間: 2025-3-28 12:10 作者: laparoscopy 時(shí)間: 2025-3-28 18:08
Weighted de Bruijn Graphs for the Menage Problem and Its Generalizationsnd no . consecutive persons are of the same gender. While the case of . corresponds to the classical . with a well-studied solution, no closed-form expression for the number of seating arrangements is known when ...We propose a novel approach for this type of problems based on enumeration of walks i作者: 油膏 時(shí)間: 2025-3-28 19:17
Reconfiguration of Steiner Trees in an Unweighted Graphansforms a given Steiner tree into another one by exchanging a single edge at a time. In this paper, we show that the problem is PSPACE-complete even for split graphs (and hence for chordal graphs), while solvable in linear time for interval graphs.作者: 類人猿 時(shí)間: 2025-3-28 23:30 作者: Ingest 時(shí)間: 2025-3-29 07:09 作者: galley 時(shí)間: 2025-3-29 08:00 作者: exigent 時(shí)間: 2025-3-29 11:29 作者: exacerbate 時(shí)間: 2025-3-29 17:56
Weighted de Bruijn Graphs for the Menage Problem and Its Generalizationsn certain algebraically weighted de Bruijn graphs. Our approach leads to new expressions for the menage numbers and their exponential generating function and allows one to efficiently compute the number of seating arrangements in general cases, which we illustrate in detail for the ternary case of ..作者: 蜈蚣 時(shí)間: 2025-3-29 21:07
Conference proceedings 2016t 2016. . The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combina作者: 隱語 時(shí)間: 2025-3-30 02:31 作者: 白楊 時(shí)間: 2025-3-30 05:05
https://doi.org/10.1007/978-3-658-34328-6ng the first . algorithm for updating 2-hop cover labelings for distance queries. We also conduct an extensive experimental study on real and synthetic dynamic networks, to show the scalability and efficiency of our new methods.作者: Endoscope 時(shí)間: 2025-3-30 11:35 作者: 戰(zhàn)役 時(shí)間: 2025-3-30 15:52
On the Complexity of Computing Treebreadthh bag has a dominating vertex. We show that it is NP-complete to decide whether a graph belongs to this class. We then prove some structural properties of such graphs which allows us to design polynomial-time algorithms to decide whether a bipartite graph, resp., a planar graph, has treebreadth one.作者: 微塵 時(shí)間: 2025-3-30 19:45
Distance Queries in Large-Scale Fully Dynamic Complex Networksng the first . algorithm for updating 2-hop cover labelings for distance queries. We also conduct an extensive experimental study on real and synthetic dynamic networks, to show the scalability and efficiency of our new methods.作者: 粘 時(shí)間: 2025-3-30 22:41
Weighted Online Problems with Adviced maximization problems. We also show that our algorithmic techniques for dealing with weighted requests can be extended to work for non-complete . problems such as Matching (giving better results than what follow from the general . results) and even non-. problems such as scheduling.作者: Free-Radical 時(shí)間: 2025-3-31 02:55
Conference proceedings 2016ed: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combinatorial algorithms; graph algorithms; combinatorics; and probabilistics.?.作者: 拖債 時(shí)間: 2025-3-31 06:53
0302-9743 They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combinatorial algorithms; graph algorithms; combinatorics; and probabilistics.?.978-3-319-44542-7978-3-319-44543-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 憤慨點(diǎn)吧 時(shí)間: 2025-3-31 09:21
Zur Konstruktion von Wirklichkeitenhe given graph is a forest. This partially answers a question raised recently by Angelini et al. and Chang et al., and proves that c-planarity testing of flat clustered graphs with three clusters is tractable when the underlying abstract graph is a forest.
