„Graph computing“
Suchergebnisse
2.363 Treffer
-
Efficient Orthogonal Drawings of High Degree Graphs
-
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
-
Maintaining Regular Properties Dynamically in k-Terminal Graphs
-
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
-
On Certificates and Lookahead in Dynamic Graph Problems
-
Separators in Graphs with Negative and Multiple Vertex Weights
-
Approximation Algorithms for Requirement Cut on Graphs
-
Binding number and minimum degree for the existence of (g,f,n)-critical graphs
-
Structural properties for certain classes of infinite planar graphs
-
Some results on starlike trees and sunlike graphs
-
The classification of complete graphsK n onf-coloring
-
Combining partial Jacobian computation and preconditioning: New heuristics, educational modules, and applications
-
On domination numbers of graph bundles
-
On oriented 2-factorable graphs
-
Edge covering coloring of nearly bipartite graphs
-
User interface design affects security: patterns in click-based graphical passwords
-
An extension of Sallee’s theorem to infinite locally finite vap-free plane graphs
-
Weak embedding of planar graphs
-
Augmenting the Connectivity of Outerplanar Graphs
-
Token-based graphical password authentication