scientific article
From MaRDI portal
Publication:3586724
zbMath1218.05001MaRDI QIDQ3586724
Publication date: 1 September 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (36)
An Improved Approximation Algorithm for the Matching Augmentation Problem ⋮ On the Fine-Grained Complexity of Rainbow Coloring ⋮ A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems ⋮ Two-ended quasi-transitive graphs ⋮ Topological infinite gammoids, and a new Menger-type theorem for infinite graphs ⋮ Bounds on the burning number ⋮ Upper bound on the diameter of a domination dot-critical graph ⋮ Geodesic continued fractions ⋮ A Stronger Bound for the Strong Chromatic Index ⋮ Sharp separation and applications to exact and parameterized algorithms ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ First-Order Convergence and Roots ⋮ Nearly exact mining of frequent trees in large networks ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A UNIFIED THEORY OF TRUTH AND PARADOX ⋮ Classification of spherical tilings by congruent quadrangles over pseudo-double wheels. I: A special tiling by congruent concave quadrangles ⋮ The flip Markov chain for connected regular graphs ⋮ Hybrid Tractable Classes of Constraint Problems ⋮ Some classes of perfect strongly annihilating-ideal graphs associated with commutative rings ⋮ Every rayless graph has an unfriendly partition ⋮ First-Order Model-Checking in Random Graphs and Complex Networks ⋮ Cycle flows and multistability in oscillatory networks ⋮ On multiaspect graphs ⋮ An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem ⋮ Ground state properties of the SSH model ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The smallest self-dual embeddable graphs in a pseudosurface ⋮ Computing vertex-disjoint paths in large graphs using MAOs ⋮ Distributed secondary frequency control in microgrids: robustness and steady-state performance in the presence of clock drifts ⋮ Multistability in lossy power grids and oscillator networks ⋮ The strong 3-rainbow index of edge-amalgamation of some graphs ⋮ Dual parameterization of weighted coloring ⋮ Strengthened chain theorems for different versions of 4-connectivity ⋮ Some classifications of graphs with respect to a set adjacency relation ⋮ Embedding Graphs into Embedded Graphs
This page was built for publication:
