News
A New Algorithm for Graph Crossings, Hiding in Plain Sight Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.
Coxeter Theory and Graph Algorithms Publication Trend The graph below shows the total number of publications each year in Coxeter Theory and Graph Algorithms.
A new algorithm efficiently solves the graph isomorphism problem, which has puzzled computer scientists for decades.
We integrate the bar relaxation into an interval-graph algorithm for OPP, which operates on such overlapping relations. Numerical results on 2D and 3D instances demonstrate the efficiency of ...
Thomas E. Dilts, Peter J. Weisberg, Philip Leitner, Marjorie D. Matocq, Richard D. Inman, Kenneth E. Nussear, Todd C. Esque, Multiscale connectivity and graph theory ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results