Induced matchings in intersection graphs
Reads0
Chats0
TLDR
It is shown that if G is a polygon-circle graph, then so is [ L ( G )] 2 , and the same holds for asteroidal triple-free and interval-filament graphs, and it follows that the induced matching problem is polytime-solvable in these classes.About:
This article is published in Discrete Mathematics.The article was published on 2004-03-06 and is currently open access. It has received 89 citations till now. The article focuses on the topics: Chordal graph & Indifference graph.read more
Citations
More filters
Journal ArticleDOI
On the approximability of the maximum induced matching problem
TL;DR: In this paper, the authors considered the maximum induced matching problem (MIM) and gave an approximation algorithm with asymptotic performance ratio d −1 for MIM in d -regular graphs, for each d ⩾3.
Proceedings ArticleDOI
Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks
TL;DR: It is shown that in many cases, as the interference degree increases, the Local Pooling conditions are more likely to hold, and although increased interference reduces the maximum achievable throughput of the network, it tends to enable distributed algorithms to achieve 100% of this throughput.
Journal ArticleDOI
The parameterized complexity of the induced matching problem
Hannes Moser,Somnath Sikdar +1 more
TL;DR: This work provides first-time fixed-parameter tractability results for planar graphs, bounded-degree graphs, graphs with girth at least six, bipartite graphs, line graphs, and graphs of bounded treewidth.
Journal ArticleDOI
Matchings, coverings, and Castelnuovo-Mumford regularity
TL;DR: In this article, the co-chordal cover number of a graph G gives an upper bound for the Castelnuovo-Mumford regularity of the associated edge ideal.
Journal ArticleDOI
The graphs with maximum induced matching and maximum matching the same size
Kathie Cameron,Tracy Walker +1 more
TL;DR: This work gives a simple characterization of graphs and provides a simpler recognition algorithm for finding a maximum induced matching in a graph where equality holds.
References
More filters
Book
Flows in networks
D. R. Ford,D. R. Fulkerson +1 more
TL;DR: Ford and Fulkerson as mentioned in this paper set the foundation for the study of network flow problems and developed powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Book
Algorithmic graph theory and perfect graphs
TL;DR: This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems and remains a stepping stone from which the reader may embark on one of many fascinating research trails.
Journal ArticleDOI
Flows in Networks.
TL;DR: The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.