Filters








5,546 Hits in 5.2 sec

Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems [article]

Jiří Fiala and Tomáš Gavenčiak and Dušan Knop and Martin Koutecký and Jan Kratochvíl
2015 arXiv   pre-print
the neighborhood diversity together with the largest weight.  ...  We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view.  ...  . , p k )-labeling on graphs of bounded neighborhood diversity.  ... 
arXiv:1507.00640v2 fatcat:2xlaquhqxbfc5gedz5hqjc4v6e

Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits

Thibaut Vidal, Nelson Maculan, Luiz Satoru Ochi, Puca Huachi Vaz Penna
2016 Transportation Science  
Promising research avenues on hybridizations with standard routing neighborhoods are also open.  ...  The search is conducted on "exhaustive" solutions visiting all customers, while an efficient "Select" algorithm, based on resource-constrained shortest paths, is repeatedly used to select customers and  ...  Solving the resource-constrained shortest path on this graph to findP (σ 1 ⊕ · · · ⊕ σ M ) is equivalent to solving a resource-constrained shortest path on a multi-graph, where arcs are duplicated B times  ... 
doi:10.1287/trsc.2015.0584 fatcat:rj2p2ehrtbfypfaniyip4wfzrm

Parameterized Algorithms for Modular-Width [chapter]

Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
2013 Lecture Notes in Computer Science  
of m colors (this is not a graph coloring, though), 4. and the existence of a G-edge between u, v ∈ V (G) depends solely on the colors of u, v and the distance between u, v in T .  ...  We thus argue that modular-width occupies a sweet spot as a graph parameter, generalizing several simpler notions on dense graphs but still evading the "price of generality" paid by clique-width. * Research  ...  ., there are graphs with bounded modular-width and unbounded neighborhood diversity (or unbounded twin-cover number). Proof. Let G be a graph.  ... 
doi:10.1007/978-3-319-03898-8_15 fatcat:h7jroriijbfwple2bschwuujfa

Parameterized Algorithms for Modular-Width [article]

Jakub Gajarský and Michael Lampis and Sebastian Ordyniak
2013 arXiv   pre-print
We thus argue that modular-width occupies a sweet spot as a graph parameter, generalizing several simpler notions on dense graphs but still evading the "price of generality" paid by clique-width.  ...  It is therefore desirable to find a different structural graph parameter which is as general as possible, covers dense graphs but does not incur such a heavy algorithmic penalty.  ...  ., there are graphs with bounded modular-width and unbounded neighborhood diversity (or unbounded twin-cover number). Proof. Let G be a graph.  ... 
arXiv:1308.2858v2 fatcat:433mrukqlbhy3avakvjximj2gy

A Generalized Weisfeiler-Lehman Graph Kernel [article]

Till Hendrik Schulz, Tamás Horváth, Pascal Welke, Stefan Wrobel
2021 arXiv   pre-print
Their key concept is based on an implicit comparison of neighborhood representing trees with respect to equality (i.e., isomorphism).  ...  We achieve this using a specifically fitted variation of the well-known tree edit distance which can efficiently be calculated.  ...  diverse graphs.  ... 
arXiv:2101.08104v1 fatcat:ei2fjayhzzduhlnxuq7re2xbwa

Large neighborhoods with implicit customer selection for vehicle routing problems with profits [article]

Thibaut Vidal, Nelson Maculan, Puca Huachi Vaz Penna, Luis Satoru Ochi
2014 arXiv   pre-print
Promising research avenues on hybridizations with more standard routing neighborhoods are also open.  ...  The search is conducted with standard VRP neighborhoods on an "exhaustive" solution representation, visiting all customers.  ...  Solving the resource constrained shortest path on this graph to findP (σ 1 ⊕ · · · ⊕ σ M ) is equivalent to solving a resource constrained shortest path on a multi-graph, where arcs are duplicated B times  ... 
arXiv:1401.3794v2 fatcat:al5mqsulzrhfpio3uliud3d5mi

A Constrained Shortest Path Scheme for Virtual Network Service Management [article]

Dmitrii Chemodanov, Flavio Esposito, Prasad Calyam, Andrei Sukhov
2018 arXiv   pre-print
To address such scalability challenges, we propose a novel, exact constrained shortest path algorithm viz., 'Neighborhoods Method' (NM).  ...  Our NM uses novel search space reduction techniques and has a theoretical quadratic speed-up making it practically faster (by an order of magnitude) than recent branch-and-bound exhaustive search solutions  ...  Generally, for any two stage or one-shot VNE algorithm, constrained shortest paths can be used to best improve the objective value while Neighborhood Build (forward pass) first (using label-correcting  ... 
arXiv:1808.03031v1 fatcat:gvhucrs3zjhv3ol46o3i3rcoie

Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory [article]

Juho Hirvonen, Laura Schmid, Krishnendu Chatterjee, Stefan Schmid
2021 arXiv   pre-print
In particular, we make the observation that the equilibria of graphical games are equivalent to locally verifiable labelings (LVL) in graphs; vertex labelings which are verifiable with a constant-round  ...  Since we establish that distributed convergence can sometimes be provably slow, we also introduce and give bounds on an intuitive notion of "time-constrained" inefficiency of best responses.  ...  A mapping : → Σ of the graph is a solution to if and only if each -labelled -neighborhood of is a configuration in C.  ... 
arXiv:2102.13457v2 fatcat:5ply6ouibrbpfb6iz2t2hxcwby

Multimodal News Story Clustering With Pairwise Visual Near-Duplicate Constraint

Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann
2008 IEEE transactions on multimedia  
Experiments on TRECVID-2004 corpus demonstrate that CCC with visual constraints is more capable of mining news topics of varying densities, shapes and sizes, compared with traditional -means, DBSCAN, and  ...  With CCC, the duality between stories and their underlying multimodal features is exploited to transform features in low-dimensional space with normalized cut.  ...  With reference to Table I , the performance is 23.7% lower than the one with manual labeling.  ... 
doi:10.1109/tmm.2007.911778 fatcat:nbl3t33qrzgwpjmdbm4rqbr75q

RAQ: Relationship-Aware Graph Querying in Large Networks [article]

Jithin Vachery, Akhil Arora, Sayan Ranu, Arnab Bhattacharya
2021 arXiv   pre-print
Extensive experiments on multiple real-world graph datasets demonstrate RAQ to be effective, efficient, and scalable.  ...  However, almost all existing techniques have tacitly ignored the presence of relationships in graphs, which are usually encoded through interactions between node and edge labels.  ...  Equipped with the above upper bounds, we prioritize each of the initial 1-edge common subgraphs based on ( , ) (Theorem 2).  ... 
arXiv:1801.06402v3 fatcat:5s2yqjmpqjhhvan6ceo6mh2noi

Methods for mining co–location patterns with extended spatial objects

Robert Bembenik, Wiktor Jóźwicki, Grzegorz Protaziuk
2017 International Journal of Applied Mathematics and Computer Science  
The paper discusses various approaches to mining co-location patterns with extended spatial objects.  ...  We focus on the properties of transaction-free approaches EXCOM and DEOSP, and discuss the differences between the method using a buffer and that employing clustering and triangulation.  ...  The neighboring graph generation phase requires a distance parameter and creates vertexes for spatial objects connecting them with edges wherever neighbor relationships are found.  ... 
doi:10.1515/amcs-2017-0047 fatcat:lhe6k3tiufgctlvpon7qdhncvm

Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads [article]

Matheus Nohra Haddad, Rafael Martinelli, Thibaut Vidal, Luiz Satoru Ochi, Simone Martins, Marcone Jamilson Freitas Souza, Richard Hartl
2018 arXiv   pre-print
Experimental results on new multi-vehicle instances with distance constraints are also reported.  ...  We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and  ...  The best distance bound is updated during the search, and any label whose distance exceeds this bound can be pruned.  ... 
arXiv:1802.06318v1 fatcat:gy5f6yjmunhebczms4gkiwlmkq

OR-Net: Pointwise Relational Inference for Data Completion under Partial Observation [article]

Qianyu Feng, Linchao Zhu, Bang Zhang, Pan Pan, Yi Yang
2021 arXiv   pre-print
Contemporary data-driven methods are typically fed with full supervision on large-scale datasets which limits their applicability.  ...  ; (ii) On the other hand, the unseen targets are inferred by learning the cross-relationship with the observed data points.  ...  In order to better incorporate IB with the graph-based structure, here we follow the local dependence assumption to constrain the optimizing space: Messages aggregated on each node from its neighbors within  ... 
arXiv:2105.00397v2 fatcat:bpq6beyy7fgtdkiclvg3tighde

An Efficient Fusion Move Algorithm for the Minimum Cost Lifted Multicut Problem [chapter]

Thorsten Beier, Björn Andres, Ullrich Köthe, Fred A. Hamprecht
2016 Lecture Notes in Computer Science  
Many computer vision problems can be cast as an optimization problem whose feasible solutions are decompositions of a graph. The minimum cost lifted multicut problem is such an optimization problem.  ...  the additional constraints ∀e ∈ E : x e ≤ x 1 e + x 2 e . (7) That is, all edges which are labeled 0 (join) in the feasible solution x 1 and the feasible solution x 2 are constrained to be labeled 0 in  ...  Moreover, we replace the multicut objective with a lifted multicut objective containing only a sparse set of lifted edges up to a graph distance of 5. We do not contract any edges in pre-processing.  ... 
doi:10.1007/978-3-319-46475-6_44 fatcat:axuuje6qmfc47l4zwyb5qpx5a4

Shape Similarity Analysis by Self-Tuning Locally Constrained Mixed-Diffusion

Lei Luo, Chunhua Shen, Chunyuan Zhang, Anton van den Hengel
2013 IEEE transactions on multimedia  
Furthermore, we advocate the use of self-adaptive neighborhoods to automatically determine the appropriate size of the neighborhoods in the diffusion process, with which the retrieval performance is comparable  ...  To this end, we propose the locally constrained mixeddiffusion method, which partly fuses the given measures into one and propagates on the resulted locally dense data space.  ...  The edge of G l is labeled with the strength of affinity w l (i, j) = ρ l (x i , x j ).  ... 
doi:10.1109/tmm.2013.2242450 fatcat:7wqufi7xxfd2ddpyn73pok5vpi
« Previous Showing results 1 — 15 out of 5,546 results