Topology of series-parallel networks
From MaRDI portal
Publication:2394739
DOI10.1016/0022-247X(65)90125-3zbMath0128.37002OpenAlexW2073840571WikidataQ100604477 ScholiaQ100604477MaRDI QIDQ2394739
Publication date: 1965
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(65)90125-3
Related Items
Perfect edge domination and efficient edge domination in graphs, A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs, A compact labelling scheme for series-parallel graphs, A solvable case of quadratic 0-1 programming, Arborescence polytopes for series-parallel graphs, Two-edge connected spanning subgraphs and polyhedra, Approximating the distribution functions in stochastic networks, Combinatorial algorithms on a class of graphs, On some complexity properties of N-free posets and posets with bounded decomposition diameter, A polynomial time algorithm to compute the connected treewidth of a series-parallel graph, Multiterminal duality and three-terminal series-parallelness, Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron, \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs, N-free posets as generalizations of series-parallel posets, Parallel recognition and decomposition of two terminal series parallel graphs, Metric graphs elastically embeddable in the plane, Minimum-maximal matching in series-parallel graphs, A note on algebraic expressions of rhomboidal labeled graphs, Chromatic invariants for finite graphs: Theme and polynomial variations, On the stable set polytope of a series-parallel graph, Fractional and integral colourings, On perfectly two-edge connected graphs, Note on inseparability graphs of matroids having exactly one class of orientations, Cuts, matrix completions and graph rigidity, The search for chromatically unique graphs. II, Network topology and the efficiency of equilibrium, Embeddings of circulant networks, The subgraph homeomorphism problem for small wheels, The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs, The Brown-Colbourn conjecture on zeros of reliability polynomials is false, Chromaticity of series-parallel graphs, Braess's paradox for flows over time, Concurrency and atomicity, Structural conditions for cycle completable graphs, Colouring cubic graphs by small Steiner triple systems, Some results on the injective chromatic number of graphs, On \(r\)-hued coloring of \(K_4\)-minor free graphs, On-line algorithms for orders, Inefficiencies in network models: a graph-theoretic perspective, On certain polytopes associated with graphs, Acyclic edge coloring of graphs with large girths, On algebraic expressions of directed grid graphs, Coherent orientations and series-parallel networks, Handsome proof-nets: Perfect matchings and cographs, Series-parallel orientations preserving the cycle-radius, Coloring the square of a \(K_{4}\)-minor free graph, Polytope des independants d'un graphe série-parallèle, Graph minors. XVI: Excluding a non-planar graph, On series-parallel extensions of uniform matroids, Equistable series-parallel graphs, On \(r\)-acyclic edge colorings of planar graphs, On graphs with no induced subdivision of \(K_4\), Delta-wye reduction of almost-planar graphs, A search problem on graphs which generalizes some group testing problems with two defectives, Algorithms for recognition of regular properties and decomposition of recursive graph families, Complete monotonicity for inverse powers of some combinatorially defined polynomials, A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs, Strong equilibrium in network congestion games: increasing versus decreasing costs, Web services composition: complexity and models, Signature of power graphs, Solution of Rota's problem on the order of series-parallel networks, The real positive semidefinite completion problem for series-parallel graphs, Complexity of rainbow vertex connectivity problems for restricted graph classes, Lower bounds for positive semidefinite zero forcing and their applications, Deciding whether graph \(G\) has page number one is in NC, Circuit and bond polytopes on series-parallel graphs, The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs, The anti-join composition and polyhedra, Parallel recognition of series-parallel graphs, General vertex disjoint paths in series-parallel graphs, Series parallel linkages, On survivable network polyhedra, Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade, Covering planar graphs with forests, The regular matroids with no 5-wheel minor, Tropical curves of hyperelliptic type, Box-total dual integrality, box-integrality, and equimodular matrices, The box-TDI system associated with 2-edge connected spanning subgraphs, On spin models, triply regular association schemes, and duality, Confluence up to garbage in graph transformation, On the unimodality of the independent set numbers of a class of matroids, The Tutte polynomial of a ported matroid, The Schrijver system of the flow cone in series-parallel graphs, Four problems on graphs with excluded minors, Structure and recognition of graphs with no 6-wheel subdivision, Cover and variable degeneracy, Social learning in nonatomic routing games, A survey on interval routing, Acyclic edge colorings of planar graphs and series parallel graphs, The line index and minimum cut of weighted graphs, Reduction algorithms for graphs of small treewidth, A note on the tour problems in two-terminal series-parallel graphs, An approach to the subgraph homeomorphism problem, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey, Counting representable sets on simple graphs, A cubic algorithm for the directed Eulerian subgraph problem, Morphisms and currents in infinite nonlinear resistive networks, Proof theory for linear lattices, The quadratic 0-1 knapsack problem with series-parallel support, The Steiner tree polytope and related polyhedra, A graphical representation of relational formulae with complementation, Describing the local structure of sequence graphs, A tight relation between series-parallel graphs and bipartite distance hereditary graphs, LIST POINT ARBORICITY OF GRAPHS, On the Uniqueness of Equilibrium in Atomic Splittable Routing Games, Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs, A homogenization result for planar, polygonal networks, On group choosability of total graphs, An Analytic Propositional Proof System on Graphs, The Merino-Welsh conjecture holds for series-parallel graphs, Lehman's Theorem and the Directed Steiner Tree Problem, Colouring series-parallel graphs, Characterization and Recognition of Partial 3-Trees, Searching for an intruder on graphs and their subdivisions, Collusion in atomic splittable routing games, On lengths of edge-labeled graph expressions, Edge-group choosability of outerplanar and near-outerplanar graphs, Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs, Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions, On Strict (Outer-)Confluent Graphs, Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings, Resolving Braess's paradox in random networks, Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs, Strong chromatic index of \(K_4\)-minor free graphs, Estimation of expressions' complexities for two-terminal directed acyclic graphs, Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs, Chronological rectangle digraphs which are two-terminal series-parallel, List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs, Confluence up to Garbage, Trader multiflow and box-TDI systems in series-parallel graphs, Toughness and spanning trees in K4‐minor‐free graphs, Market equilibrium in multi‐tier supply chain networks, Motives of melonic graphs, A note on social learning in non-atomic routing games, Multistage \(s-t\) path: confronting similarity with dissimilarity, Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs, Capacity-preserving subgraphs of directed flow networks, Measuring the distance to series-parallelity by path expressions, Box-total dual integrality and edge-connectivity, Unnamed Item, Unnamed Item, Exact Learning of Finite Unions of Graph Patterns from Queries, Unnamed Item, The st-bond polytope on series-parallel graphs, Graph theory in Coq: minors, treewidth, and isomorphisms, Substitutes and Complements in Constrained Linear Models, Graphs with no 7-wheel subdivision, Network Resilience, A Combinatorial Model for Series-Parallel Networks, Equistable distance-hereditary graphs, Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs, A new graph parameter related to bounded rank positive semidefinite matrix completions, Series-parallel graphs are windy postman perfect, Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries, Distance Hereditary Graphs and the Interlace Polynomial, Algorithms for core stability, core largeness, exactness, and extendability of flow games, The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\), On the dominant of the Steiner 2-edge connected subgraph polytope, Steiner trees and polyhedra, Determinacy in Linear Systems and Networks, Max-multiflow/min-multicut for G+H series-parallel, Normal forms for binary relations, Complexity of finding a join of maximum weight, Consensus in asynchronous multiagent systems. III: Constructive stability and stabilizability, Minimum-cost strong network orientation problems: Classification, complexity, and algorithms, Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs, Unnamed Item, Unnamed Item, Informational Braess’ Paradox: The Effect of Information on Traffic Congestion, Analyse de sensibilité pour les problèmes linéaires en variables 0-1, Hadwiger’s Conjecture, Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks, Weak Unit Disk and Interval Representation of Graphs, Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited, \(k\)-edge connected polyhedra on series-parallel graphs, Applications of matroids in electric network theory, Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems, The Concept of Two-Chord Tiesets and Its Application to an Algebraic Characterization of Non-Series-Parallel Graphs, Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph, The entire coloring of series-parallel graphs, Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2, The \(r\)-acyclic chromatic number of planar graphs, A linear-time certifying algorithm for recognizing generalized series-parallel graphs, Nested Graphs, \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method, Denotational fixed-point semantics for constructive scheduling of synchronous concurrency, Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs, Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
Cites Work
