Search Results - G.2.2 Graph Theory – Graph algorithms

Exact values for three domination-like problems in circular and infinite grid graphs of small height by Bouznif, Marwane, Darlay, Julien, Moncel, Julien, Preissmann, Myriam

“… We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height…”
Get full text

The Readability of Path-Preserving Clusterings of Graphs by Archambault, Daniel, Purchase, Helen C., Pinaud, Bruno

“…Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs…”
Get full text

Quasi-biclique edge concentration: A visual analytics method for biclustering by Onoue, Yosuke, Koyamada, Koji

“… Biclustering finds bicliques contained in a bipartite graph. However, in real data, a biclique may lack several edges because of various reasons, such as errors…”
Get full text

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings by Didimo, Walter, Kornaropoulos, Evgenios M., Montecchiani, Fabrizio, Tollis, Ioannis G.

“… Besides the algorithm for acyclic digraphs, the DAGView framework implements extensions to visualize both digraphs with cycles and undirected graphs, with the additional possibility of taking…”
Get full text

Exploring agent-based simulations in political science using Aggregate Temporal Graphs by Crouser, R. Jordan, Freeman, Jeremy G., Winslow, Andrew, Chang, Remco

“… In this paper, we introduce the Aggregate Temporal Graph (ATG), a graph formulation that can be used to capture complex relationships between discrete simulation states in time…”
Get full text

The mental map and memorability in dynamic graphs by Archambault, D., Purchase, H. C.

“…In dynamic graph drawing, preserving the mental map, or ensuring that the location of nodes do not change significantly as the information evolves over time is considered an important property by algorithm designers…”
Get full text

A visual canonical adjacency matrix for graphs by Hongli Li, Grinstein, G., Costello, L.

“…Graph data mining algorithms rely on graph canonical forms to compare different graph structures…”
Get full text

Extending the spring-electrical model to overcome warping effects by Yifan Hu, Koren, Y.

“…The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing large graphs…”
Get full text

Visual Analysis of Large Graphs: State-of-the-Art and Future Research Challenges by von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., van Wijk, J.J., Fekete, J.-D., Fellner, D.W.

“…The analysis of large graphs plays a prominent role in various fields of research and is relevant in many important application areas…”
Get full text

Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques by van Den Brand, Jan, Zhang, Daniel J.

“… This differs from the single commodity problem (e.g. maximum flow) where all recent improvements also rely on graph specific techniques such as graph decompositions or the Laplacian paradigm…”
Get full text

On the use of graph search techniques for the analysis of extreme-scale combustion simulation data by McLendon, W. C., Bansal, G., Bremer, P.-T, Chen, J., Kolla, H., Bennett, J. C.

“…With the continuous increase in high performance computing capabilities, simulations are becoming ever larger and more complex, using bigger domains, tracking…”
Get full text

Maximum Entropy Summary Trees by Karloff, Howard, Shirley, Kenneth E.

“…‐programming algorithm to compute this maximum entropy summary tree…”
Get full text

An explicit construction of graphs of bounded degree that are far from being Hamiltonian by Adler, Isolde, Köhler, Noleen

“…Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions…”
Get full text

ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges by Simonetto, Paolo, Archambault, Daniel, Auber, David, Bourqui, Romain

“…PrEd [Ber00] is a force‐directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties…”
Get full text

On the monophonic rank of a graph by Dourado, Mitre C., Ponciano, Vitor S., da Silva, Rômulo L. O.

“…A set of vertices $S$ of a graph $G$ is {\em monophonically convex} if every induced path joining two vertices of $S$ is contained in $S$. The…”
Get full text

On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width by Rajaati, M., Hooshmandasl, M. R., Dinneen, M. J., Shakiba, A.

“…A mixed dominating set for a graph $G = (V,E)$ is a set $S\subseteq V \cup E$ such that every element $x \in (V \cup E) \backslash…”
Get full text

Efficient Path Generation with Reduced Coordinates by Chen, Renjie, Gotsman, Craig, Hormann, Kai

“…Path generation is an important problem in many fields, especially robotics. One way to create a path between a source point z and a target point y inside a…”
Get full text

Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs by Keranen, Melissa, Lauri, Juho

“…A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same…”
Get full text

A Linear Kernel for Planar Total Dominating Set by Garnero, Valentin, Sau, Ignasi

“…A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V…”
Get full text

On rank-width of even-hole-free graphs by Adler, Isolde, Le, Ngoc Khang, Müller, Haiko, Radovanović, Marko, Trotignon, Nicolas, Vušković, Kristina

“…We present a class of (diamond, even hole)-free graphs with no clique cutset that has unbounded rank-width…”
Get full text