Exact exponential algorithms
Exact exponential algorithms Page 1 80 coMMunicATions of ThE AcM | MARCh 2013 | Vol. 56
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …
Solving connectivity problems parameterized by treewidth in single exponential time
For the vast majority of local problems on graphs of small tree width (where by local we
mean that a solution can be verified by checking separately the neighbourhood of each …
mean that a solution can be verified by checking separately the neighbourhood of each …
A tutorial on clique problems in communications and signal processing
Since its first use by Euler on the problem of the seven bridges of Königsberg, graph theory
has shown excellent abilities in solving and unveiling the properties of multiple discrete …
has shown excellent abilities in solving and unveiling the properties of multiple discrete …
[图书][B] RDF database systems: triples storage and SPARQL query processing
RDF Database Systems is a cutting-edge guide that distills everything you need to know to
effectively use or design an RDF database. This book starts with the basics of linked open …
effectively use or design an RDF database. This book starts with the basics of linked open …
Coordinated scheduling and decentralized federated learning using conflict clustering graphs in fog-assisted IoD networks
MS Al-Abiad, MJ Hossain - IEEE Transactions on Vehicular …, 2022 - ieeexplore.ieee.org
Despite the advantages of fog-assisted internet of drones (IoD) networks for federated
learning (FL) model aggregations, it is restricted by the limited battery capacity of drones and …
learning (FL) model aggregations, it is restricted by the limited battery capacity of drones and …
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs
M Xiao, H Nagamochi - Theoretical Computer Science, 2013 - Elsevier
We present an O∗(1.0836 n)-time algorithm for finding a maximum independent set in an n-
vertex graph with degree bounded by 3, which improves all previous running time bounds …
vertex graph with degree bounded by 3, which improves all previous running time bounds …
Coordinated scheduling and power control in cloud-radio access networks
This paper addresses the joint coordinated scheduling and power control problem in cloud-
enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where …
enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where …
Delay reduction in multi-hop device-to-device communication using network coding
This paper considers the problem of reducing the broadcast decoding delay of wireless
networks using instantly decodable network coding-based device-to-device …
networks using instantly decodable network coding-based device-to-device …
[HTML][HTML] Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
N Bourgeois, B Escoffier, VT Paschos - Discrete Applied Mathematics, 2011 - Elsevier
Using ideas and results from polynomial time approximation and exact computation we
design approximation algorithms for several NP-hard combinatorial problems achieving …
design approximation algorithms for several NP-hard combinatorial problems achieving …
Throughput maximization in cloud-radio access networks using cross-layer network coding
Cloud radio access networks (C-RANs) are promising paradigms for the fifth-generation
(5G) networks due to their interference management capabilities. In a C-RAN, a central …
(5G) networks due to their interference management capabilities. In a C-RAN, a central …