Search results

{{Short description|Mathematical modeling language}} ...m''' ('''VAS''') is one of several mathematical modeling languages for the description of [[distributed systems]]. Vector addition systems were introduced by [[Ri ...

{{Short description|Connectivity measure in graph theory}} {{Graph connectivity sidebar}} ...

{{Short description|Difficulty measures for computer science problems}} * BH_2''k'' is the class of languages which are the [[intersection (set theory)|intersection]] of a language in B ...

{{Short description|Theorem in algebra}} ...rticle/pii/002200008390003X ''Groups, the theory of ends, and context-free languages''.] ...

{{Short description|Algorithmic problem with applications to program analysis}} ...determine whether there exists a [[Path (graph theory)|path]] through the graph such that the concatenation of the labels along the path is a string accept ...

{{Short description|Programming language}} ...nal and unconditional jumps. FCL lives up to its name as the abstract call-graph of an FCL program is a straightforward flow chart. ...

{{Short description|Numerical invariant of graphs}} {{about|an [[graph invariant|invariant of graphs]]|the distance from the root in an abstract t ...

{{Short description|Recursively splitting a graph into subsets of nodes}} ...recursive]] (hierarchical) decomposition of the graph, instead of just a [[Graph partition|partition]]. ...

{{Short description|Graph data structure}} In [[computer science]], an '''e-graph''' is a [[data structure]] that stores an [[equivalence relation]] over [[T ...

{{short description|Software feature}} ...e 26th ACM International Conference on Object-Oriented Programming Systems Languages and Applications (OOPSLA 2011)|pages=407–426|publisher=[[Association ...

{{Short description|Variation of a finite automaton that runs on infinite input}} ...on can be regarded as a nondeterministic ω-automaton by taking Δ to be the graph of δ. The definitions of runs and acceptance for deterministic ω-automata a ...

{{Short description|Software design structured around a node graph}} ...a [[software design]] structured around the notion of a [[#Node_Graph|node graph]]. Both the [[source code]] and the [[user interface]] are designed around ...

{{Short description|Combinatorial optimization graph problem}} ...hose removal would partition the graph to at least {{mvar|k}} [[component (graph theory)|connected components]]. These edges are referred to as '''{{mvar|k} ...

...ut, multi-output system represented as a noncommutative matrix signal-flow graph.]] ...rconnected systems and state machines by mapping the edges of a [[directed graph]] to a [[ring (mathematics)|ring]] or [[semiring]]. ...

{{Short description|Branch of applied mathematics}} ===Graph Theory=== ...

{{Short description|Graph which can be made planar by removing a single node}} ...theory#Subgraphs|subgraph]] formed by removing the red vertex is [[planar graph|planar]].]] ...

{{short description|Solution to the reachability problem in distributed systems (computer scien ...8">{{Cite journal| last1 = Bochmann| first1 = G.v. | title = Finite State Description of Communication Protocols, Computer Networks, Vol. 2 (1978), pp. 361-372 } ...

{{Short description|Method used in automata theory to represent tree structures using arithmeti ...utomata theory, a '''tree''' is a particular way of representing a [[Tree (graph theory)|tree structure]] as sequences of natural numbers. ...

{{short description|API for graph data and graph operations}} | domain = Graph algorithms ...

{{short description|Problem of finding the longest simple path for a given graph}} ...imate]]. However, it has a [[linear time]] solution for [[directed acyclic graph]]s, which has important applications in finding the [[Critical path method| ...