A REVIEW OF TREE CONVEX SETS TEST
From MaRDI portal
Publication:4649838
DOI10.1111/j.1467-8640.2012.00418.xzbMath1251.91034OpenAlexW2154658620MaRDI QIDQ4649838
Forrest Sheng Bao, Yuan Lin Zhang
Publication date: 15 November 2012
Published in: Computational Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1467-8640.2012.00418.x
constraint satisfaction problemsconsecutive ones propertytree convex setscombinatorial auction problemsrow convex constraints
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (18)
Acyclic Matching in Some Subclasses of Graphs ⋮ Domination in some subclasses of bipartite graphs ⋮ Circular convex bipartite graphs: feedback vertex sets ⋮ Union Closed Tree Convex Sets ⋮ Injective coloring of some subclasses of bipartite graphs and chordal graphs ⋮ Exact square coloring of certain classes of graphs: complexity and algorithms ⋮ Feedback vertex sets on restricted bipartite graphs ⋮ Acyclic matching in some subclasses of graphs ⋮ Complexity and algorithms for injective edge coloring of graphs ⋮ Algorithmic and complexity aspects of problems related to total restrained domination for graphs ⋮ Global total \(k\)-domination: approximation and hardness results ⋮ On partial Grundy coloring of bipartite graphs and chordal graphs ⋮ Maximum weight induced matching in some subclasses of bipartite graphs ⋮ Differentiating-total domination: approximation and hardness results ⋮ Dominating induced matching in some subclasses of bipartite graphs ⋮ On the complexity of minimum maximal uniquely restricted matching ⋮ Circular Convex Bipartite Graphs: Feedback Vertex Set ⋮ Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results
Cites Work
- BOB: Improved winner determination in combinatorial auctions and generalizations
- Tree clustering for constraint networks
- Consistency in networks of relations
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- On the consecutive ones property
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Networks of constraints: Fundamental properties and applications to picture processing
- Incidence matrices and interval graphs
- Computationally Manageable Combinational Auctions
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- Syntactic Characterization of Tree Database Schemas
- A Simple Test for the Consecutive Ones Property
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Power of Natural Semijoins
- Algorithmic Aspects of Vertex Elimination on Graphs
- Synthesizing constraint expressions
This page was built for publication: A REVIEW OF TREE CONVEX SETS TEST
