Výsledky vyhľadávania - G.2.2 [Discrete Mathematics]: Graph Theory- Graph algorithms

Exact values for three domination-like problems in circular and infinite grid graphs of small height Autor 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…”
Získať plný text

The Readability of Path-Preserving Clusterings of Graphs Autor 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…”
Získať plný text

Quasi-biclique edge concentration: A visual analytics method for biclustering Autor 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…”
Získať plný text

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings Autor 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…”
Získať plný text

Exploring agent-based simulations in political science using Aggregate Temporal Graphs Autor 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…”
Získať plný text

The mental map and memorability in dynamic graphs Autor 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…”
Získať plný text

Extending the spring-electrical model to overcome warping effects Autor 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…”
Získať plný text

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

“…Graph data mining algorithms rely on graph canonical forms to compare different graph structures…”
Získať plný text

On the use of graph search techniques for the analysis of extreme-scale combustion simulation data Autor 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…”
Získať plný text

Visual Analysis of Large Graphs: State-of-the-Art and Future Research Challenges Autor 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…”
Získať plný text

An explicit construction of graphs of bounded degree that are far from being Hamiltonian Autor 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…”
Získať plný text

On the monophonic rank of a graph Autor 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…”
Získať plný text

ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges Autor 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…”
Získať plný text

On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width Autor 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…”
Získať plný text

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

“…A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same…”
Získať plný text

On rank-width of even-hole-free graphs Autor 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…”
Získať plný text

A Linear Kernel for Planar Total Dominating Set Autor 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…”
Získať plný text

Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix Autor Nguyên, Lê Thành Dũng

“…This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003…”
Získať plný text

Finding a hamilton path through a family of intervals Autor Sridhar, M. A., Goyal, S.

“…We develop an o(nx(n)) algorithm for computing a hamilton path in a family of n intervals, where x is an inverse of Ackerman's function…”
Získať plný text

Parallel algorithms for a multi-level network optimization problem Autor Cruz, F.R.B., Mateus†, G.R.

“… This paper is mainly concerned with parallel implementations of the classical branch-and-bound algorithm for multi-level network design…”
Získať plný text