Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

Coupling hadronic kinetic theory models to fluid dynamics in phenomenological studies of heavy ion collisions requires a prescription for ``particlization''. Existing particlization are based on implicit or explicit assumptions about the microscopic degrees freedom that go beyond information provided by preceding dynamical history. We propose an alternative which uses only macroscopic hydrodyna...

We present a simple distributed ∆-approximation algorithm for maximum weight independent set (MaxIS) in the CONGEST model which completes in O(MIS(G) · logW ) rounds, where ∆ is the maximum degree, MIS(G) is the number of rounds needed to compute a maximal independent set (MIS) on G, and W is the maximum weight of a node. Plugging in the best known algorithm for MIS gives a randomized solution ...

Several papers have achieved time O( √ nm) for cardinality matching, starting from first principles. This results in a long derivation. We simplify the task by employing well-known concepts for maximum weight matching. We use Edmonds’ algorithm to derive the structure of shortest augmenting paths. We extend this to a complete algorithm for maximum cardinality matching in time O( √ nm).

Given a pair of graphs with the same number vertices, inexact graph matching problem consists in finding correspondence between vertices these that minimizes total number...