|
Induced Path
In the mathematical area of graph theory, an induced path in an undirected graph is a path that is an induced subgraph of . That is, it is a sequence of vertices in such that each two adjacent vertices in the sequence are connected by an edge in , and each two nonadjacent vertices in the sequence are not connected by any edge in . An induced path is sometimes called a snake, and the problem of finding long induced paths in hypercube graphs is known as the snake-in-the-box problem. Similarly, an induced cycle is a cycle that is an induced subgraph of ; induced cycles are also called chordless cycles or (when the length of the cycle is four or more) holes. An antihole is a hole in the complement of , i.e., an antihole is a complement of a hole. The length of the longest induced path in a graph has sometimes been called the detour number of the graph; for sparse graphs, having bounded detour number is equivalent to having bounded tree-depth. The induced path number of a gra ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Snake In The Box
The snake-in-the-box problem in graph theory and computer science deals with finding a certain kind of path along the edges of a hypercube. This path starts at one corner and travels along the edges to as many corners as it can reach. After it gets to a new corner, the previous corner and all of its neighbors must be marked as unusable. The path should never travel to a corner which has been marked unusable. In other words, a ''snake'' is a connected open path in the hypercube where each node connected with path, with the exception of the head (start) and the tail (finish), it has exactly two neighbors that are also in the snake. The head and the tail each have only one neighbor in the snake. The rule for generating a snake is that a node in the hypercube may be visited if it is connected to the current node and it is not a neighbor of any previously visited node in the snake, other than the current node. In graph theory terminology, this is called finding the longest possible i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cograph
In graph theory, a cograph, or complement-reducible graph, or ''P''4-free graph, is a graph that can be generated from the single-vertex graph ''K''1 by complementation and disjoint union. That is, the family of cographs is the smallest class of graphs that includes ''K''1 and is closed under complementation and disjoint union. Cographs have been discovered independently by several authors since the 1970s; early references include , , , and . They have also been called D*-graphs, hereditary Dacey graphs (after the related work of James C. Dacey Jr. on orthomodular lattices), and 2-parity graphs. They have a simple structural decomposition involving disjoint union and complement graph operations that can be represented concisely by a labeled tree and used algorithmically to efficiently solve many problems such as finding a maximum clique that are hard on more general graph classes. Special types of cograph include complete graphs, complete bipartite graphs, cluster graphs, and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
IRE Transactions On Electronic Computers
''IEEE Transactions on Computers'' is a monthly peer-reviewed scientific journal covering all aspects of computer design. It was established in 1952 and is published by the IEEE Computer Society. The editor-in-chief is Prof. Avinash Karanth, Chair of the School of Electrical Engineering and Computer Science (EECS) at Ohio University. According to the ''Journal Citation Reports'', the journal has a 2023 impact factor The impact factor (IF) or journal impact factor (JIF) of an academic journal is a type of journal ranking. Journals with higher impact factor values are considered more prestigious or important within their field. The Impact Factor of a journa ... of 3.6. References External links * Transactions on Computers Computer science journals English-language journals Academic journals established in 1952 Monthly journals {{compu-journal-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Information Processing Letters
''Information Processing Letters'' is a peer review, peer-reviewed scientific journal in the field of computer science, published by Elsevier. The aim of the journal is to enable fast dissemination of results in the field of Data processing, information processing in the form of short papers. Submissions are limited to nine double-spaced pages. The scope of IPL covers fundamental aspects of information processing and computing. This naturally covers topics in the broadly understood field of theoretical computer science, including algorithms, formal languages and automata, computational complexity, computational logic, distributed and parallel algorithms, computational geometry, learning theory, computational number theory, computational biology, coding theory, theoretical cryptography, and applied discrete mathematics. Generally, submissions in all areas of scientific inquiry are considered, provided that they describe research contributions credibly motivated by applications to com ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ars Combinatoria (journal)
''Ars Combinatoria, a Canadian Journal of Combinatorics'' is an English language research journal in combinatorics, published by the Charles Babbage Research Centre, Winnipeg, Manitoba, Canada. From 1976 to 1988 it published two volumes per year, and subsequently it published as many as six volumes per year. The journal is indexed in ''MathSciNet'' and '' Zentralblatt''. As of 2019, SCImago Journal Rank listed it in the bottom quartile of miscellaneous mathematics journals. As of December 15, 2021, the editorial board of the journal resigned, asking that inquiries be directed to the publisher. In 2024, Combinatorial Press announced that they had taken over publishing the journal. Under the new publisher, authors may opt for subscription-only publication at no fee, with a mandatory 2-year embargo Economic sanctions or embargoes are commercial and financial penalties applied by states or institutions against states, groups, or individuals. Economic sanctions are a form of coerc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Information And Computation
''Information and Computation'' is a closed-access computer science journal published by Elsevier (formerly Academic Press). The journal was founded in 1957 under its former name ''Information and Control'' and given its current title in 1987. , the current editor-in-chief is David Peleg. The journal publishes 12 issues a year. History ''Information and Computation'' was founded as ''Information and Control'' in 1957 at the initiative of Leon Brillouin and under the editorship of Leon Brillouin, Colin Cherry and Peter Elias. Murray Eden joined as editor in 1962 and became sole editor-in-chief in 1967. He was succeeded by Albert R. Meyer in 1981, under whose editorship the journal was rebranded ''Information and Computation'' in 1987 in response to the shifted focus of the journal towards theory of computation and away from control theory. In 2020, Albert Mayer was succeeded by David Peleg as editor-in-chief of the journal. Indexing All articles from the ''Information and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Algebra And Its Applications
''Linear Algebra and its Applications'' is a biweekly peer-reviewed mathematics journal published by Elsevier and covering matrix theory and finite-dimensional linear algebra. History The journal was established in January 1968 with A.J. Hoffman, A.S. Householder, A.M. Ostrowski, H. Schneider, and O. Taussky Todd as founding editors-in-chief. The current editors-in-chief are Richard A. Brualdi ( University of Wisconsin at Madison), Volker Mehrmann (Technische Universität Berlin), and Peter Semrl (University of Ljubljana). Abstracting and indexing The journal is abstracted and indexed in: According to the ''Journal Citation Reports'', the journal has a 2020 impact factor The impact factor (IF) or journal impact factor (JIF) of an academic journal is a type of journal ranking. Journals with higher impact factor values are considered more prestigious or important within their field. The Impact Factor of a journa ... of 1.401. References {{Reflist Algebra journ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Independent Set (graph Theory)
In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a set S of vertices such that for every two vertices in S, there is no edge connecting the two. Equivalently, each edge in the graph has at most one endpoint in S. A set is independent if and only if it is a clique in the graph's complement. The size of an independent set is the number of vertices it contains. Independent sets have also been called "internally stable sets", of which "stable set" is a shortening. A maximal independent set is an independent set that is not a proper subset of any other independent set. A maximum independent set is an independent set of largest possible size for a given graph G. This size is called the independence number of ''G'' and is usually denoted by \alpha(G). The optimization problem of finding such a set is called the maximum independent set problem. It is a strongly NP-hard problem. As ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mihalis Yannakakis
Mihalis Yannakakis (; born 13 September 1953 in Athens, Greece)Columbia University: CV: Mihalis Yannakakis (accessed 12 November 2009) is a professor of computer science at . He is noted for his work in , , and other related fields. He won the Donald E. Knuth Prize in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Block Graph
Block or blocked may refer to: Arts, entertainment and media Broadcasting * Block programming, the result of a programming strategy in broadcasting * W242BX, a radio station licensed to Greenville, South Carolina, United States known as ''96.3 the Block '' * WFNZ-FM, a radio station licensed to Harrisburg, North Carolina, United States, branded as ''92.7 The Block'' * "Blocked", an episode of the television series '' The Flash'' Music * Block Entertainment, a record label * Blocks Recording Club, a record label * Woodblock (instrument), a small piece of slit drum made from one piece of wood and used as a percussion instrument * "Blocks", by C418 from '' Minecraft – Volume Beta'', 2013 Toys * Toy block, one of a set of wooden or plastic pieces, of various shapes * Unit block, a type of standardized wooden toy block for children Video games * Blocked (video game), a puzzle game for the iPhone and iPod Touch Building and construction * Concrete block, cinder block or ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distance-hereditary Graph
In graph theory, a branch of discrete mathematics, a distance-hereditary graph (also called a completely separable graph) is a graph in which the Distance (graph theory), distances in any connected graph, connected induced subgraph are the same as they are in the original graph. Thus, any induced subgraph inherits the distances of the larger graph. Distance-hereditary graphs were named and first studied by , although an equivalent class of graphs was already shown to be perfect graph, perfect in 1970 by Olaru and Sachs. It has been known for some time that the distance-hereditary graphs constitute an intersection class of graphs, but no intersection model was known until one was given by . Definition and characterization The original definition of a distance-hereditary graph is a graph such that, if any two vertices and belong to a connected induced subgraph of , then some shortest path connecting and in must be a subgraph of , so that the distance between and in is the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Perfect Graph
In graph theory, a perfect graph is a Graph (discrete mathematics), graph in which the Graph coloring, chromatic number equals the size of the maximum clique, both in the graph itself and in every induced subgraph. In all graphs, the chromatic number is greater than or equal to the size of the maximum clique, but they can be far apart. A graph is perfect when these numbers are equal, and remain equal after the deletion of arbitrary subsets of vertices. The perfect graphs include many important families of graphs and serve to unify results relating Graph coloring, colorings and cliques in those families. For instance, in all perfect graphs, the graph coloring problem, maximum clique problem, and maximum independent set problem can all be solved in polynomial time, despite their greater complexity for non-perfect graphs. In addition, several important minimax theorems in combinatorics, including Dilworth's theorem and Mirsky's theorem on partially ordered sets, Kőnig's theorem (gra ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
