
Minimum TJoins and SignedCircuit Covering
Let G be a graph and T be a vertex subset of G with even cardinality. A ...
read it

Flooding edge or node weighted graphs
Reconstruction closings have all properties of a physical flooding of a ...
read it

On Learning a Hidden Directed Graph with Path Queries
In this paper, we consider the problem of reconstructing a directed grap...
read it

A compact, structural analysis amenable, portHamiltonian circuit analysis
This article presents a simple portHamiltonian formulation of the equat...
read it

HandDrawn Electrical Circuit Recognition using Object Detection and Node Recognition
With the recent developments in neural networks, there has been a resurg...
read it

A* with Perfect Potentials
Quickly determining shortest paths in networks is an important ingredien...
read it

Observability Properties of Colored Graphs
A colored graph is a directed graph in which either nodes or edges have ...
read it
Kirchhoff's Circuit Law Applications to Graph Simplification in Search Problems
This paper proposes a new analysis of graph using the concept of electric potential, and also proposes a graph simplification method based on this analysis. Suppose that each node in the weightedgraph has its respective potential value. Furthermore, suppose that the start and terminal nodes in graphs have maximum and zero potentials, respectively. When we let the level of each node be defined as the minimum number of edges/hops from the start node to the node, the proper potential of each level can be estimated based on geometric proportionality relationship. Based on the estimated potential for each level, we can redesign the graph for pathfinding problems to be the electrical circuits, thus Kirchhoff's Circuit Law can be directed applicable for simplifying the graph for pathfinding problems.
READ FULL TEXT
Comments
There are no comments yet.