Computing, ISSN 0010-485X, 9/2013, Volume 95, Issue 9, pp. 739 - 758

...Computing (2013) 95:739–758 DOI 10.1007/s00607-012-0263-3 Finding large k-clubs in undirected graphs Maw-Shang Chang · Ling-Ju Hung · Chih-Ren Lin · Ping-Chen...

k$$ -Neighborhood | 05C85 | Computer Appl. in Administrative Data Processing | 90B10 | Branch and bound | k$$ -Club | Software Engineering | Computer Science | Artificial Intelligence (incl. Robotics) | Information Systems Applications (incl. Internet) | Computer Science, general | 68R10 | Computer Communication Networks | k -Neighborhood | k -Club | Studies | Computer science | Social networks | Branch & bound algorithms | Heuristic | Cohesion | Algorithms | Heuristic methods | Deletion | Graphs | Subgroups | Combinatorial analysis

k$$ -Neighborhood | 05C85 | Computer Appl. in Administrative Data Processing | 90B10 | Branch and bound | k$$ -Club | Software Engineering | Computer Science | Artificial Intelligence (incl. Robotics) | Information Systems Applications (incl. Internet) | Computer Science, general | 68R10 | Computer Communication Networks | k -Neighborhood | k -Club | Studies | Computer science | Social networks | Branch & bound algorithms | Heuristic | Cohesion | Algorithms | Heuristic methods | Deletion | Graphs | Subgroups | Combinatorial analysis

Journal Article

BMC systems biology, ISSN 1752-0509, 2011, Volume 5, Issue 1, pp. 145 - 145

...Authors: Wu-Hsiung Wu [1]; Feng-Sheng Wang (corresponding author) [2]; Maw-Shang Chang [1] Background Improving the synthesis rate of desired metabolites...

PATHWAYS | DESIGN | EVOLUTION | ESCHERICHIA-COLI | MATHEMATICAL & COMPUTATIONAL BIOLOGY | ETHANOL | CONSTRAINED OPTIMIZATION | BIOCHEMICAL SYSTEMS | MODEL DEFINITION | SACCHAROMYCES-CEREVISIAE | MAXIMIZATION | Saccharomyces cerevisiae - metabolism | Metabolic Engineering - methods | Ethanol - metabolism | Bioreactors | Models, Biological | Enzymes - genetics | Escherichia coli - metabolism | Metabolic Networks and Pathways - physiology | Fermentation | Fuzzy Logic | Amino Acids - biosynthesis | Studies | Problems | Algorithms | Metabolites | Optimization

PATHWAYS | DESIGN | EVOLUTION | ESCHERICHIA-COLI | MATHEMATICAL & COMPUTATIONAL BIOLOGY | ETHANOL | CONSTRAINED OPTIMIZATION | BIOCHEMICAL SYSTEMS | MODEL DEFINITION | SACCHAROMYCES-CEREVISIAE | MAXIMIZATION | Saccharomyces cerevisiae - metabolism | Metabolic Engineering - methods | Ethanol - metabolism | Bioreactors | Models, Biological | Enzymes - genetics | Escherichia coli - metabolism | Metabolic Networks and Pathways - physiology | Fermentation | Fuzzy Logic | Amino Acids - biosynthesis | Studies | Problems | Algorithms | Metabolites | Optimization

Journal Article

3.
Full Text
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs

Theoretical Computer Science, ISSN 0304-3975, 2011, Volume 412, Issue 39, pp. 5351 - 5373

A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is an evidence that can be...

Interval graphs | Path cover | Circular-arc graphs | Hamiltonian cycle | Certifying algorithms | INTERVAL-GRAPHS | SET | RECOGNITION | PATH COVER PROBLEM | QUERY | LOG N) ALGORITHM | COMPUTER SCIENCE, THEORY & METHODS | LINEAR-TIME ALGORITHMS | Algorithms | Graphs | Circularity | Complexity

Interval graphs | Path cover | Circular-arc graphs | Hamiltonian cycle | Certifying algorithms | INTERVAL-GRAPHS | SET | RECOGNITION | PATH COVER PROBLEM | QUERY | LOG N) ALGORITHM | COMPUTER SCIENCE, THEORY & METHODS | LINEAR-TIME ALGORITHMS | Algorithms | Graphs | Circularity | Complexity

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 05/2011, Volume 412, Issue 23, pp. 2496 - 2502

Let G be a class of graphs. A graph G has G-width k if there are k independent sets N1,…,Nk in G such that G can be embedded into a graph H∈G such that for...

Parameterized algorithms | Probe graphs | Block graphs | COMPUTER SCIENCE, THEORY & METHODS | VERTEX-MINORS | Blocking | Graphs | C (programming language)

Parameterized algorithms | Probe graphs | Block graphs | COMPUTER SCIENCE, THEORY & METHODS | VERTEX-MINORS | Blocking | Graphs | C (programming language)

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2008, Volume 308, Issue 18, pp. 4185 - 4204

Let Y be a subset of real numbers. A Y-dominating function of a graph G = ( V , E ) is a function f : V → Y such that ∑ u ∈ N G [ v ] f ( u ) ⩾ 1 for all...

Dually chordal graphs | Minus domination | Signed domination | Dominating functions | k-Tuple domination | Strongly chordal graphs | [formula omitted]-Domination | { k }-Domination | PERFECT GRAPHS | dually chordal graphs | signed domination | CLIQUE-TRANSVERSAL | minus domination | strongly chordal graphs | MATHEMATICS | ALGORITHMIC ASPECTS | TREES | dominating functions | k-tuple domination | SETS | CHORDAL GRAPHS | {k}-domination | BIPARTITE GRAPHS

Dually chordal graphs | Minus domination | Signed domination | Dominating functions | k-Tuple domination | Strongly chordal graphs | [formula omitted]-Domination | { k }-Domination | PERFECT GRAPHS | dually chordal graphs | signed domination | CLIQUE-TRANSVERSAL | minus domination | strongly chordal graphs | MATHEMATICS | ALGORITHMIC ASPECTS | TREES | dominating functions | k-tuple domination | SETS | CHORDAL GRAPHS | {k}-domination | BIPARTITE GRAPHS

Journal Article

BMC Bioinformatics, ISSN 1471-2105, 10/2010, Volume 11, Issue 7, pp. S12 - S12

Background: Mathematical modeling has been applied to the study and analysis of complex biological systems for a long time. Some processes in biological...

APOPTOSIS | ACTIVATION | BIOCHEMICAL RESEARCH METHODS | DEATH | AUTOMATIC DIFFERENTIATION | MATHEMATICAL-MODEL | PATHWAY | BIOTECHNOLOGY & APPLIED MICROBIOLOGY | MATHEMATICAL & COMPUTATIONAL BIOLOGY | CHEMICAL KINETIC SYSTEMS | DIFFERENTIAL-EQUATION SOLVER | TNF-ALPHA | NF-KAPPA-B | Tumor Necrosis Factor-alpha - metabolism | Systems Biology - methods | Reproducibility of Results | Algorithms | Cardiovascular System - metabolism | Signal Transduction | Time Factors | Models, Biological | Computer Simulation | DNA Fragmentation | Humans | NF-kappa B - metabolism | C plus plus | Derivatives | Gene expression | Manuscripts | Studies | Computer science | Human error | Signal transduction | Accuracy | Neural networks | Ordinary differential equations | Mathematical models

APOPTOSIS | ACTIVATION | BIOCHEMICAL RESEARCH METHODS | DEATH | AUTOMATIC DIFFERENTIATION | MATHEMATICAL-MODEL | PATHWAY | BIOTECHNOLOGY & APPLIED MICROBIOLOGY | MATHEMATICAL & COMPUTATIONAL BIOLOGY | CHEMICAL KINETIC SYSTEMS | DIFFERENTIAL-EQUATION SOLVER | TNF-ALPHA | NF-KAPPA-B | Tumor Necrosis Factor-alpha - metabolism | Systems Biology - methods | Reproducibility of Results | Algorithms | Cardiovascular System - metabolism | Signal Transduction | Time Factors | Models, Biological | Computer Simulation | DNA Fragmentation | Humans | NF-kappa B - metabolism | C plus plus | Derivatives | Gene expression | Manuscripts | Studies | Computer science | Human error | Signal transduction | Accuracy | Neural networks | Ordinary differential equations | Mathematical models

Journal Article

SIAM journal on computing, ISSN 1095-7111, 1998, Volume 27, Issue 6, pp. 1671 - 1694

... PROBLEMS ON INTERVAL AND CIRCULAR-ARC GRAPHS MAW-SHANG CHANG Abstract. This paper rst presents a unied approach to design e cient algorithms for the weighted...

Domination | Interval graphs | Circular-arc graphs | Graph algorithms | MATHEMATICS, APPLIED | domination | DISJOINT SET UNION | RECOGNITION | circular-arc graphs | LINEAR-TIME ALGORITHM | OPTIMAL PARALLEL ALGORITHMS | CHORDAL GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | VERTICES | interval graphs | graph algorithms

Domination | Interval graphs | Circular-arc graphs | Graph algorithms | MATHEMATICS, APPLIED | domination | DISJOINT SET UNION | RECOGNITION | circular-arc graphs | LINEAR-TIME ALGORITHM | OPTIMAL PARALLEL ALGORITHMS | CHORDAL GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | VERTICES | interval graphs | graph algorithms

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2006, Volume 154, Issue 3, pp. 525 - 536

In this paper, we show that the clique-transversal number τ C ( G ) and the clique-independence number α C ( G ) are equal for any distance-hereditary graph G....

Graphs | Clique-independence number | Distance-hereditary graphs | Clique-transversal number | distance-hereditary graphs | ALGORITHMIC ASPECTS | MATHEMATICS, APPLIED | graphs | TRANSVERSAL | clique-transversal number | SETS | CHORDAL GRAPHS | clique-independence number | Algorithms

Graphs | Clique-independence number | Distance-hereditary graphs | Clique-transversal number | distance-hereditary graphs | ALGORITHMIC ASPECTS | MATHEMATICS, APPLIED | graphs | TRANSVERSAL | clique-transversal number | SETS | CHORDAL GRAPHS | clique-independence number | Algorithms

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 2005, Volume 341, Issue 1, pp. 411 - 440

A Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once. A Hamiltonian cycle of a graph is a simple cycle with the same...

Graph algorithms | Hamiltonian problems | Linear-time algorithms | Distance-hereditary graphs | distance-hereditary graphs | PATH | linear-time algorithms | COCOMPARABILITY GRAPHS | DOMINATION | CLIQUE-WIDTH | TREE | COMPUTER SCIENCE, THEORY & METHODS | CIRCUIT PROBLEM | graph algorithms | CYCLE | Computer science | Algorithms

Graph algorithms | Hamiltonian problems | Linear-time algorithms | Distance-hereditary graphs | distance-hereditary graphs | PATH | linear-time algorithms | COCOMPARABILITY GRAPHS | DOMINATION | CLIQUE-WIDTH | TREE | COMPUTER SCIENCE, THEORY & METHODS | CIRCUIT PROBLEM | graph algorithms | CYCLE | Computer science | Algorithms

Journal Article

Theory of Computing Systems, ISSN 1432-4350, 10/2011, Volume 49, Issue 3, pp. 576 - 587

...Theory Comput Syst (2011) 49:576–587 DOI 10.1007/s00224-010-9276-5 A Property T ester for Tree-Likeness of Quartet T opologies Maw-Shang Chang · Chuang-Chieh...

Quartet method | Computational Mathematics and Numerical Analysis | Evolutionary tree | Computer Science | Property testing | Theory of Computation | Randomized algorithm | MATHEMATICS | APPROXIMATION | INFERRING EVOLUTIONARY TREES | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Algorithms | Studies | Topological manifolds | Mathematical models | Tasks | Topology | Computation | Mathematical analysis

Quartet method | Computational Mathematics and Numerical Analysis | Evolutionary tree | Computer Science | Property testing | Theory of Computation | Randomized algorithm | MATHEMATICS | APPROXIMATION | INFERRING EVOLUTIONARY TREES | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Algorithms | Studies | Topological manifolds | Mathematical models | Tasks | Topology | Computation | Mathematical analysis

Journal Article

Theory of Computing Systems, ISSN 1432-4350, 8/2010, Volume 47, Issue 2, pp. 342 - 367

...Theory Comput Syst (2010) 47: 342–367 DOI 10.1007/s00224-009-9165-y New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem Maw-Shang...

Computational Mathematics and Numerical Analysis | Evolutionary tree | Depth-bounded search tree | Computer Science | Leaf-labeled tree | Quartet topology | Theory of Computation | Minimum quartet inconsistency problem | Fixed-parameter algorithm | MATHEMATICS | TREES | COMPUTER SCIENCE, THEORY & METHODS | Studies | Topological manifolds | Mathematical analysis | Genetic algorithms | Trees | Algorithms | Topology | Computation | Evolutionary

Computational Mathematics and Numerical Analysis | Evolutionary tree | Depth-bounded search tree | Computer Science | Leaf-labeled tree | Quartet topology | Theory of Computation | Minimum quartet inconsistency problem | Fixed-parameter algorithm | MATHEMATICS | TREES | COMPUTER SCIENCE, THEORY & METHODS | Studies | Topological manifolds | Mathematical analysis | Genetic algorithms | Trees | Algorithms | Topology | Computation | Evolutionary

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2009, Volume 157, Issue 12, pp. 2611 - 2619

Given a class of graphs G , a graph G is a probe graph of G if its vertices can be partitioned into two sets, P , the probes, and an independent set N , the...

Weakly chordal graphs | Modular decomposition | Permutation graphs | Minimum fill-in | Probe graphs | Treewidth | INTERVAL-GRAPHS | MATHEMATICS, APPLIED | ALGORITHM | CHORDAL GRAPHS | SLIM GRAPHS | TRANSITIVE ORIENTATION | Computer science | Investigations | Algorithms

Weakly chordal graphs | Modular decomposition | Permutation graphs | Minimum fill-in | Probe graphs | Treewidth | INTERVAL-GRAPHS | MATHEMATICS, APPLIED | ALGORITHM | CHORDAL GRAPHS | SLIM GRAPHS | TRANSITIVE ORIENTATION | Computer science | Investigations | Algorithms

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 2008, Volume 396, Issue 1, pp. 212 - 222

Given a class of graphs G , a graph G is a probe graph of G if its vertices can be partitioned into a set of probes and an independent set of nonprobes such...

Graph recognition algorithms | Permutation graphs | Cocomparability graphs | Comparability graphs | Probe graphs | RECOGNITION | probe graphs | cocomparability graphs | ALGORITHM | graph recognition algorithms | COMPUTER SCIENCE, THEORY & METHODS | comparability graphs | TRANSITIVE ORIENTATION | MODULAR DECOMPOSITION | permutation graphs

Graph recognition algorithms | Permutation graphs | Cocomparability graphs | Comparability graphs | Probe graphs | RECOGNITION | probe graphs | cocomparability graphs | ALGORITHM | graph recognition algorithms | COMPUTER SCIENCE, THEORY & METHODS | comparability graphs | TRANSITIVE ORIENTATION | MODULAR DECOMPOSITION | permutation graphs

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 12/2018, Volume 251, pp. 114 - 125

A bounded-degree-1 set S in an undirected graph G=(V,E) is a vertex subset such that the maximum degree of G[S] is at most one. Given a graph G, the Maximum...

Vertex cover P3 | 2-plex | Exact algorithm | Approximation algorithm | Bounded-degree-1 set | MATHEMATICS, APPLIED | KERNEL | 3-PATH VERTEX COVER | MODEL | Algorithms | Run time (computers) | Approximations | Social networks | Set theory | Graph theory | Polynomials

Vertex cover P3 | 2-plex | Exact algorithm | Approximation algorithm | Bounded-degree-1 set | MATHEMATICS, APPLIED | KERNEL | 3-PATH VERTEX COVER | MODEL | Algorithms | Run time (computers) | Approximations | Social networks | Set theory | Graph theory | Polynomials

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 1997, Volume 80, Issue 2, pp. 135 - 148

It is shown in this paper that the weighted domination problem and its three variants, the weighted connected domination, total domination, and dominating...

PERFECT DOMINATION | MATHEMATICS, APPLIED | HAMILTONIAN CYCLE | POLYNOMIAL ALGORITHMS

PERFECT DOMINATION | MATHEMATICS, APPLIED | HAMILTONIAN CYCLE | POLYNOMIAL ALGORITHMS

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2002, Volume 116, Issue 1, pp. 103 - 113

The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in...

Domination | Leaf | Labeling | Distance-hereditary graph | Neighborhood | Twin | CONNECTED DOMINATION | MATHEMATICS, APPLIED | domination | labeling | R-DOMINATION | neighborhood | leaf | distance-hereditary graph | twin | STEINER TREES

Domination | Leaf | Labeling | Distance-hereditary graph | Neighborhood | Twin | CONNECTED DOMINATION | MATHEMATICS, APPLIED | domination | labeling | R-DOMINATION | neighborhood | leaf | distance-hereditary graph | twin | STEINER TREES

Journal Article

2014 International Computer Science and Engineering Conference (ICSEC), 07/2014, pp. 12 - 17

Given a graph G = (V, E), a P 2 -packing P is a collection of vertex disjoint copies of P 2 s in G where a P 2 is a simple path with three vertices and two...

Computer science | Algorithm design and analysis | P 2 -packing | net-free graphs | Particle separators | kernelization algorithm | Educational institutions | Polynomials | Bipartite graph | Kernel | packing | Net-free graphs | Kernelization algorithm

Computer science | Algorithm design and analysis | P 2 -packing | net-free graphs | Particle separators | kernelization algorithm | Educational institutions | Polynomials | Bipartite graph | Kernel | packing | Net-free graphs | Kernelization algorithm

Conference Proceeding

Information Processing Letters, ISSN 0020-0190, 1995, Volume 56, Issue 3, pp. 165 - 171

An edge dominating set D of graph G = ( V, E) is a set of edges such that every edge not in D is adjacent to at least one edge in D. We develop polynomial time...

Bipartite permutation graphs | Algorithms | Graph algorithms | Edge domination

Bipartite permutation graphs | Algorithms | Graph algorithms | Edge domination

Journal Article

Smart Innovation, Systems and Technologies, ISSN 2190-3018, 11/2013, Volume 29, Issue 6, pp. 1109 - 142

In this paper, we study the problem Min-Max 2-Cluster Editing which asks for a modification of a given graph into two maximal cliques by inserting or deleting...

Clustering editing | NP-hard | Approximation algorithm | Algorithm | Graph modification problem | Approximation Algorithm | GRAPH MODIFICATION PROBLEMS | approximation algorithm | COMPUTER SCIENCE, INFORMATION SYSTEMS | GENERATION | graph modification problem | ALGORITHMS | clustering editing | algorithm

Clustering editing | NP-hard | Approximation algorithm | Algorithm | Graph modification problem | Approximation Algorithm | GRAPH MODIFICATION PROBLEMS | approximation algorithm | COMPUTER SCIENCE, INFORMATION SYSTEMS | GENERATION | graph modification problem | ALGORITHMS | clustering editing | algorithm

Conference Proceeding

Discrete Applied Mathematics, ISSN 0166-218X, 1997, Volume 78, Issue 1, pp. 41 - 50

This paper gives linear-time algorithms for finding two minimum (connected) dominating sets with minimum intersection for interval graphs.

Domination | Interval graphs | Graph algorithms | Intersection of minimum dominating sets | MATHEMATICS, APPLIED | domination | intersection of minimum dominating sets | PROPERTY | LINEAR-TIME ALGORITHM | interval graphs | graph algorithms

Domination | Interval graphs | Graph algorithms | Intersection of minimum dominating sets | MATHEMATICS, APPLIED | domination | intersection of minimum dominating sets | PROPERTY | LINEAR-TIME ALGORITHM | interval graphs | graph algorithms

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.