#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2013

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Anjeneya Swami Kare, Sanjeev Saxena
- 2013 Sixth International Conference on…
- 2013

Let G = (V, E) be a connected, weighted, undirected graph such that |V| = n and |E| = m. Given a shortest path P<sub>g</sub>(s, t) between a source node s and a sink node t in the graph G, computing the shortest path between source and sink without using a particular edge (or a particular node) in P<sub>g</sub>(s, t) is called Replacement Shortest Path for… (More)

In a vertex-colored graph, an edge is happy if its endpoints have the same color. Similarly, a vertex is happy if all its incident edges are happy. Motivated by the computation of homophily in social networks, we consider the algorithmic aspects of the following Maximum Happy Edges (k-MHE) problem: given a partially k-colored graph G, find an extended full… (More)

- Anjeneya Swami Kare
- Electronic Notes in Discrete Mathematics
- 2016

Let G = (V, E) (|V | = n and |E| = m) be an undirected graph with positive edge weights. Let PG(s, t) be a shortest s − t path in G. Let l be the number of edges in PG(s, t). The Edge Replacement Path problem is to compute a shortest s − t path in G\{e}, for every edge e in PG(s, t). The Node Replacement Path problem is to compute a shortest s − t path in… (More)

- Anjeneya Swami Kare, Sanjeev Saxena
- RAIT
- 2014

- ‹
- 1
- ›