Faster access than browser!
40 relations: Algorithmic efficiency, Biconnected component, Branch-decomposition, Cograph, Complete graph, Computational complexity theory, David Eppstein, Directed graph, Discrete Applied Mathematics, Disjoint union of graphs, Dominating set, Ear decomposition, Eugene Lawler, Graph enumeration, Graph operations, Graph theory, Hamiltonian completion, Hanner polytope, Homeomorphism (graph theory), Independent set (graph theory), Information and Computation, Journal of Combinatorial Theory, Journal of the ACM, K-tree, K-vertex-connected graph, Matching (graph theory), Maximal and minimal elements, Multigraph, NP-completeness, Outerplanar graph, Robert Tarjan, Series and parallel circuits, Series-parallel networks problem, Series-parallel partial order, SIAM Journal on Computing, Society for Industrial and Applied Mathematics, SPQR tree, Theoretical Computer Science (journal), Threshold graph, Treewidth.
Algorithmic efficiency
In computer science, algorithmic efficiency is a property of an algorithm which relates to the number of computational resources used by the algorithm.
New!!: Series-parallel graph and Algorithmic efficiency · See more »
Biconnected component
In graph theory, a biconnected component (also known as a block or 2-connected component) is a maximal biconnected subgraph.
New!!: Series-parallel graph and Biconnected component · See more »
Branch-decomposition
In graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary tree T with the edges of G as its leaves.
New!!: Series-parallel graph and Branch-decomposition · See more »
Cograph
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union.
New!!: Series-parallel graph and Cograph · See more »
Complete graph
No description.
New!!: Series-parallel graph and Complete graph · See more »
Computational complexity theory
Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
New!!: Series-parallel graph and Computational complexity theory · See more »
David Eppstein
David Arthur Eppstein (born 1963) is an American computer scientist and mathematician.
New!!: Series-parallel graph and David Eppstein · See more »
Directed graph
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is a set of vertices connected by edges, where the edges have a direction associated with them.
New!!: Series-parallel graph and Directed graph · See more »
Discrete Applied Mathematics
Discrete Applied Mathematics is a peer-reviewed academic journal in mathematics, published by Elsevier.
New!!: Series-parallel graph and Discrete Applied Mathematics · See more »
Disjoint union of graphs
In graph theory, a branch of mathematics, the disjoint union of graphs is an operation that combines two or more graphs to form a larger graph.
New!!: Series-parallel graph and Disjoint union of graphs · See more »
Dominating set
In graph theory, a dominating set for a graph G.
New!!: Series-parallel graph and Dominating set · See more »
Ear decomposition
In graph theory, an ear of an undirected graph G is a path P where the two endpoints of the path may coincide, but where otherwise no repetition of edges or vertices is allowed, so every internal vertex of P has degree two in P. An ear decomposition of an undirected graph G is a partition of its set of edges into a sequence of ears, such that the one or two endpoints of each ear belong to earlier ears in the sequence and such that the internal vertices of each ear do not belong to any earlier ear.
New!!: Series-parallel graph and Ear decomposition · See more »
Eugene Lawler
Eugene Leighton (Gene) Lawler (1933 – September 2, 1994) was an American computer scientist, a professor of computer science at the University of California, Berkeley.
New!!: Series-parallel graph and Eugene Lawler · See more »
Graph enumeration
In combinatorics, an area of mathematics, graph enumeration describes a class of combinatorial enumeration problems in which one must count undirected or directed graphs of certain types, typically as a function of the number of vertices of the graph.
New!!: Series-parallel graph and Graph enumeration · See more »
Graph operations
Graph operations produce new graphs from initial ones.
New!!: Series-parallel graph and Graph operations · See more »
Graph theory
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
New!!: Series-parallel graph and Graph theory · See more »
Hamiltonian completion
The Hamiltonian completion problem is to find the minimal number of edges to add to a graph to make it Hamiltonian.
New!!: Series-parallel graph and Hamiltonian completion · See more »
Hanner polytope
In geometry, a Hanner polytope is a convex polytope constructed recursively by Cartesian product and polar dual operations.
New!!: Series-parallel graph and Hanner polytope · See more »
Homeomorphism (graph theory)
In graph theory, two graphs G and G' are homeomorphic if there is a graph isomorphism from some subdivision of G to some subdivision of G'.
New!!: Series-parallel graph and Homeomorphism (graph theory) · See more »
Independent set (graph theory)
In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent.
New!!: Series-parallel graph and Independent set (graph theory) · See more »
Information and Computation
Information and Computation is a computer science journal published by Elsevier (formerly Academic Press).
New!!: Series-parallel graph and Information and Computation · See more »
Journal of Combinatorial Theory
The Journal of Combinatorial Theory, Series A and Series B, are mathematical journals specializing in combinatorics and related areas.
New!!: Series-parallel graph and Journal of Combinatorial Theory · See more »
Journal of the ACM
The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects.
New!!: Series-parallel graph and Journal of the ACM · See more »
K-tree
In graph theory, a k-tree is an undirected graph formed by starting with a (k + 1)-vertex complete graph and then repeatedly adding vertices in such a way that each added vertex has exactly k neighbors that, together, the k + 1 vertices form a clique.
New!!: Series-parallel graph and K-tree · See more »
K-vertex-connected graph
In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer than k vertices are removed.
New!!: Series-parallel graph and K-vertex-connected graph · See more »
Matching (graph theory)
In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices.
New!!: Series-parallel graph and Matching (graph theory) · See more »
Maximal and minimal elements
In mathematics, especially in order theory, a maximal element of a subset S of some partially ordered set (poset) is an element of S that is not smaller than any other element in S. A minimal element of a subset S of some partially ordered set is defined dually as an element of S that is not greater than any other element in S. The notions of maximal and minimal elements are weaker than those of greatest element and least element which are also known, respectively, as maximum and minimum.
New!!: Series-parallel graph and Maximal and minimal elements · See more »
Multigraph
In mathematics, and more specifically in graph theory, a multigraph (in contrast to a simple graph) is a graph which is permitted to have multiple edges (also called parallel edges), that is, edges that have the same end nodes.
New!!: Series-parallel graph and Multigraph · See more »
NP-completeness
In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.
New!!: Series-parallel graph and NP-completeness · See more »
Outerplanar graph
In graph theory, an outerplanar graph is a graph that has a planar drawing for which all vertices belong to the outer face of the drawing.
New!!: Series-parallel graph and Outerplanar graph · See more »
Robert Tarjan
Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician.
New!!: Series-parallel graph and Robert Tarjan · See more »
Series and parallel circuits
Components of an electrical circuit or electronic circuit can be connected in many different ways.
New!!: Series-parallel graph and Series and parallel circuits · See more »
Series-parallel networks problem
In combinatorial mathematics, the series-parallel networks problem asks for the number of series-parallel networks that can be formed using a given number of edges.
New!!: Series-parallel graph and Series-parallel networks problem · See more »
Series-parallel partial order
In order-theoretic mathematics, a series-parallel partial order is a partially ordered set built up from smaller series-parallel partial orders by two simple composition operations.
New!!: Series-parallel graph and Series-parallel partial order · See more »
SIAM Journal on Computing
The SIAM Journal on Computing is a scientific journal focusing on the mathematical and formal aspects of computer science.
New!!: Series-parallel graph and SIAM Journal on Computing · See more »
Society for Industrial and Applied Mathematics
The Society for Industrial and Applied Mathematics (SIAM) is an academic association dedicated to the use of mathematics in industry.
New!!: Series-parallel graph and Society for Industrial and Applied Mathematics · See more »
SPQR tree
In graph theory, a branch of mathematics, the triconnected components of a biconnected graph are a system of smaller graphs that describe all of the 2-vertex cuts in the graph.
New!!: Series-parallel graph and SPQR tree · See more »
Theoretical Computer Science (journal)
Theoretical Computer Science (TCS) is a computer science journal published by Elsevier, started in 1975 and covering theoretical computer science.
New!!: Series-parallel graph and Theoretical Computer Science (journal) · See more »
Threshold graph
In graph theory, a threshold graph is a graph that can be constructed from a one-vertex graph by repeated applications of the following two operations.
New!!: Series-parallel graph and Threshold graph · See more »
Treewidth
In graph theory, the treewidth of an undirected graph is a number associated with the graph.
New!!: Series-parallel graph and Treewidth · See more »
Redirects here:
SP-graph, Series parallel graph, Series-parallel digraph, Series-parallel network, Sp-graph.
References
[1] https://en.wikipedia.org/wiki/Series-parallel_graph
