Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
251 | Ehab S. Elmallah, Hosam M. F. AboElFotoh |
Circular Layout Cutsets: An Approach for Improving Consecutive Cutset Bounds for Network Reliability. |
IEEE Trans. Reliab. |
2006 |
DBLP DOI BibTeX RDF |
|
146 | Heejong Suh, Carl K. Chang |
Algorithms for the Minimal Cutsets Enumeration of Networks by Graph Search and Branch Addition. |
LCN |
2000 |
DBLP DOI BibTeX RDF |
minimal cutsets enumeration, branch addition, graph method, graph tree, sub-vertex set, graph topology, disjoint vertex set, algorithms, computational complexity, reliability, reliability, networks, graph theory, network topology, time complexity, spanning tree, binary tree, graph search |
114 | Hung-Yau Lin, Sy-Yen Kuo, Fu-Min Yeh |
Minimal Cutset Enumeration and Network Reliability Evaluation by Recursive Merge and BDD. |
ISCC |
2003 |
DBLP DOI BibTeX RDF |
|
57 | Narasimhan Ramasubramanian, Ram Subramanian, Santosh Pande |
Automatic Compilation of Loops to Exploit Operator Parallelism on Configurable Arithmetic Logic Units. |
IEEE Trans. Parallel Distributed Syst. |
2002 |
DBLP DOI BibTeX RDF |
operator parallelism, FPGAs, parallel computing, Compilers, loop transformation, reconfigurable systems |
57 | Lisa Fleischer |
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. |
IPCO |
2001 |
DBLP DOI BibTeX RDF |
|
57 | Daniel Bleichenbacher, Ueli M. Maurer |
Optimal Tree-Based One-Time Digital Signature Schemes. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
Cryptography, trees, partially ordered sets, digital signature schemes |
42 | Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic |
Perfect Graphs, Partitionable Graphs and Cutsets. |
Comb. |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C17 |
42 | David Linnan Li, Shahriar Shahriari |
Games of Chains and Cutsets in the Boolean Lattice II. |
Order |
2001 |
DBLP DOI BibTeX RDF |
Boolean lattice, games on the Boolean lattice, independent chains, maximal chain, width, cutset |
42 | Van Bang Le, Bert Randerath |
On Stable Cutsets in Line Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
42 | Béla Bajnok, Shahriar Shahriari |
On Uniform f-vectors of Cutsets in the Truncated Boolean Lattice. |
Comb. |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05D05, 06E05, 06B05, 06A07 |
42 | Hong Shen 0001, Keqin Li 0001, Si-Qing Zheng |
Separators Are as Simple as Cutsets. |
ASIAN |
1999 |
DBLP DOI BibTeX RDF |
|
38 | J. Scanlon, N. Deo |
Graph-theoretic algorithms for image segmentation. |
ISCAS (6) |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Russell Kao, Mark Horowitz |
Eliminating redundant DC equations for asymptotic waveform evaluation. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
1994 |
DBLP DOI BibTeX RDF |
|
28 | Matthew G. Reyes, David L. Neuhoff |
Lossless Reduced Cutset Coding of Markov Random Fields. |
DCC |
2010 |
DBLP DOI BibTeX RDF |
Markov random fields, source coding, information geometry, cutsets |
28 | Kevin R. Hutson, Douglas R. Shier |
Minimum spanning trees in networks with varying edge weights. |
Ann. Oper. Res. |
2006 |
DBLP DOI BibTeX RDF |
Reliability, Networks, Sensitivity analysis, Spanning trees, Cutsets, Stochastic networks |
28 | Cheol-Hoon Lee, Kang G. Shin |
Optimal Task Assignment in Homogeneous Networks. |
IEEE Trans. Parallel Distributed Syst. |
1997 |
DBLP DOI BibTeX RDF |
Array and tree networks, homogeneous networks, network flow, task assignment, maximum flows, cutsets |
28 | Gururaj S. Rao, Harold S. Stone, T. C. Hu |
Assignment of Task in a Distributed Processor System with Limited Memory. |
IEEE Trans. Computers |
1979 |
DBLP DOI BibTeX RDF |
Ford?Fulkerson algorithm, Gomory?Hu cut trees, multiterminal maximal flows, load balancing, distributed computers, Computer networks, NP-complete problems, cutsets |
24 | Jiehua Chen 0001, William S. Zwicker |
Cutsets and EF1 Fair Division of Graphs. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
24 | Jiehua Chen 0001, William S. Zwicker |
Cutsets and EF1 Fair Division of Graphs. |
AAMAS |
2024 |
DBLP BibTeX RDF |
|
24 | Krishnaiyan Thulasiraman, Tachun Lin, Muhammad S. Javed, Guoliang Xue, Zhili Zhou |
Circuits/cutsets duality and theoretical foundation of a structural approach to survivable logical topology mapping in IP-over-WDM optical networks. |
Opt. Switch. Netw. |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Annegret Katrin Wagler |
On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets. |
Discret. Appl. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Shengxin Zha, Daizong Tian, Thrasyvoulos N. Pappas |
Pattern-Based Reconstruction of K-Level Images From Cutsets. |
IEEE Trans. Image Process. |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Daniel Kumor, Carlos Cinelli, Elias Bareinboim |
Efficient Identification in Linear Structural Causal Models with Auxiliary Cutsets. |
ICML |
2020 |
DBLP BibTeX RDF |
|
24 | Abdulsalam Basabaa, Ehab S. Elmallah |
Bounding Path Exposure in Energy Harvesting Wireless Sensor Networks Using Pathsets and Cutsets. |
LCN |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Antoine Rauzy, Liu Yang |
Decision Diagram Algorithms to Extract Minimal Cutsets of Finite Degradation Models. |
Inf. |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Daniel Kumor, Bryant Chen, Elias Bareinboim |
Efficient Identification in Linear Structural Causal Models with Instrumental Cutsets. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
24 | Valerio Boncompagni, Irena Penev, Kristina Vuskovic |
Clique-cutsets beyond chordal graphs. |
J. Graph Theory |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Daniel Kumor, Bryant Chen, Elias Bareinboim |
Efficient Identification in Linear Structural Causal Models with Instrumental Cutsets. |
NeurIPS |
2019 |
DBLP BibTeX RDF |
|
24 | Ohad N. Feldheim, Yinon Spinka |
The Growth Constant of Odd Cutsets in High Dimensions. |
Comb. Probab. Comput. |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Hélio B. Macêdo Filho, Celina M. H. de Figueiredo, Z. Li, Raphael Machado |
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets. |
Discret. Appl. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Yue Song, David J. Hill 0001, Tao Liu 0012 |
Characterization of Cutsets in Networks With Application to Transient Stability Analysis of Power Systems. |
IEEE Trans. Control. Netw. Syst. |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Annegret Wagler |
Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets. |
ISCO |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Valerio Boncompagni, Irena Penev, Kristina Vuskovic |
Clique cutsets beyond chordal graphs. |
Electron. Notes Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
24 | Rajesh Mishra, M. A. Saifi, Sanjay Kumar Chaturvedi |
Enumeration of Minimal Cutsets for Directed Networks with Comparative Reliability Study for Paths or Cuts. |
Qual. Reliab. Eng. Int. |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Mohammed Elmorsy, Ehab S. Elmallah |
Packing of cutsets for a breach path detection problem. |
ICC |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Mohammed Elmorsy, Ehab S. Elmallah |
On pathsets and cutsets of a Wireless Sensor Network surveillance problem. |
ICC |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Stephan Foldes, Russ Woodroofe |
Antichain Cutsets of Strongly Connected Posets. |
Order |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Héctor Cancela 0001, Franco Robledo, Gerardo Rubino, Pablo Sartor |
Monte Carlo estimation of diameter-constrained network reliability conditioned by pathsets and cutsets. |
Comput. Commun. |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Franco Robledo, Pablo Sartor |
A simulation method for network performability estimation using heuristically computed pathsets and cutsets. |
Int. J. Metaheuristics |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Jonathan Stillman |
On Heuristics for Finding Loop Cutsets in Multiply-Connected Belief Networks |
CoRR |
2013 |
DBLP BibTeX RDF |
|
24 | Pablo Sartor, Franco Robledo |
A simulation Method for Network Performability Estimation using Heuristically-computed Pathsets and Cutsets |
CoRR |
2013 |
DBLP BibTeX RDF |
|
24 | Susana-Clara López |
Small cutsets in arc-transitive digraphs of prime degree. |
Discret. Appl. Math. |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Hong Feng, Roberta Rui Zhou |
Note on the f-vectors of cutsets in the subspace lattice. |
Discret. Math. |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Murilo Vicente Gonçalves da Silva, Kristina Vuskovic |
Decomposition of even-hole-free graphs with star cutsets and 2-joins. |
J. Comb. Theory, Ser. B |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Nicolas Sonnerat, Adrian Vetta |
Galaxy cutsets in graphs. |
J. Comb. Optim. |
2010 |
DBLP DOI BibTeX RDF |
|
24 | Nicolas Sonnerat, Adrian Vetta |
Defending Planar Graphs against Star-Cutsets. |
Electron. Notes Discret. Math. |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Rajesh Mishra, Sanjay Kumar Chaturvedi |
A Cutsets-Based Unified Framework to Evaluate Network Reliability Measures. |
IEEE Trans. Reliab. |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoliang Xue |
Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Networks. |
INFOCOM |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Mieczyslaw Borowiecki, Katarzyna Jesse-Józefczyk |
Matching cutsets in graphs of diameter 2. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Van Bang Le, Raffaele Mosca, Haiko Müller |
On stable cutsets in claw-free graphs and planar graphs. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Ádám Timár |
Cutsets in Infinite Graphs. |
Comb. Probab. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Juan José Montellano-Ballesteros |
An anti-Ramsey Theorem on edge-cutsets. |
Discuss. Math. Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Rafael B. Teixeira, Celina M. H. de Figueiredo |
The sandwich problem for cutsets: Clique cutset, k-star cutset. |
Discret. Appl. Math. |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Bruce Rothschild, Shahriar Shahriari |
Cutsets and anti-chains in linear lattices. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan |
Disjoint clique cutsets in graphs without long holes. |
J. Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Alain Cournier, Stéphane Devismes, Vincent Villain |
Snap-Stabilizing Detection of Cutsets. |
HiPC |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Van Bang Le, Raffaele Mosca, Haiko Müller |
On Stable Cutsets in Claw-Free Graphs and Planar Graphs. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Rafael B. Teixeira, Celina M. H. de Figueiredo |
The sandwich problem for cutsets. |
Electron. Notes Discret. Math. |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic |
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. |
Discret. Appl. Math. |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Mark Ramras |
Minimum cutsets in hypercubes. |
Discret. Math. |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Van Bang Le, Bert Randerath |
On stable cutsets in line graphs. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Graham Farr, Peter Eades |
Skewness of Graphs with Small Cutsets. |
Graphs Comb. |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Tao Jiang 0003, Seog-Jin Kim, Douglas B. West |
Isometric cycles, cutsets, and crowning of bridged graphs. |
J. Graph Theory |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Shahriar Shahriari |
Width and f-vectors of Cutsets in the Truncated Boolean Lattice. |
Electron. Notes Discret. Math. |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Norman D. Curet, Jason DeVinney, Matthew E. Gaston |
An efficient network flow code for finding all minimum cost s-t cutsets. |
Comput. Oper. Res. |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Abdelhamid Zemirline |
Quasi-star-cutsets and some consequences. |
Eur. J. Oper. Res. |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Juan A. Rodríguez-Velázáuez, Amauri Gutiérrez, José Luis Andres Yebra |
On spectral bounds for cutsets. |
Discret. Math. |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Paul L. Mariz, Shahriar Shahriari |
Edge-cutsets in the directed hypercube. |
Networks |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Antoine Rauzy |
Mathematical foundations of minimal cutsets. |
IEEE Trans. Reliab. |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Vincent Barré, Jean-Luc Fouquet |
On minimal cutsets in P5-free minimal imperfect graphs. |
Discret. Math. |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Matthew Haines, Shahriar Shahriari |
On the f-vectors of Cutsets in the Boolean Lattice. |
J. Comb. Theory, Ser. A |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak |
On stable cutsets in graphs. |
Discret. Appl. Math. |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Hikyoo Koh |
Applications of restrictive cutsets and topological CROSS's for minimum total load. |
ACM Southeast Regional Conference |
1999 |
DBLP DOI BibTeX RDF |
|
24 | Mustapha Bouchakour, Ali Ridha Mahjoub |
One-node cutsets and the dominating set polytope. |
Discret. Math. |
1997 |
DBLP DOI BibTeX RDF |
|
24 | Michael R. Anderson |
Efficient constructions of antichain cutsets. |
Ars Comb. |
1996 |
DBLP BibTeX RDF |
|
24 | Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra |
Small cutsets in quasiminimal Cayley graphs. |
Discret. Math. |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Jerrold R. Griggs |
Matchings, cutsets, and chain partitions in graded posets. |
Discret. Math. |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Eliezer Dekel, Jie Hu 0011 |
A Parallel Algorithm for Finding Minimum Cutsets in Reducible Graphs. |
J. Parallel Distributed Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Gérard Cornuéjols, Bruce A. Reed |
Complete Multi-partite Cutsets in Minimal Imperfect Graphs. |
J. Comb. Theory, Ser. B |
1993 |
DBLP DOI BibTeX RDF |
|
24 | Chính T. Hoàng, Frédéric Maffray |
On slim graphs, even pairs, and star-cutsets. |
Discret. Math. |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Michele Conforti, M. R. Rao |
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets. |
Discret. Math. |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Gerhard Behrendt |
The lattice of antichain cutsets of a partially ordered set. |
Discret. Math. |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Henri Jacques Suermondt, Gregory F. Cooper |
Probabilistic inference in multiply connected belief networks using loop cutsets. |
Int. J. Approx. Reason. |
1990 |
DBLP DOI BibTeX RDF |
|
24 | Akira Saito |
Covering contractible edges in 3-connected graphs. I: Covers of size three are cutsets. |
J. Graph Theory |
1990 |
DBLP DOI BibTeX RDF |
|
24 | Behzad Parviz |
On heuristics for finding loop cutsets in multiply-connected belief networks. |
UAI |
1990 |
DBLP BibTeX RDF |
|
24 | John Ginsburg, Bill Sands, Douglas B. West |
A length-width inequality for partially ordered sets with two-element cutsets. |
J. Comb. Theory, Ser. B |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Augustine M. Moshi |
Matching cutsets in graphs. |
J. Graph Theory |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Hanoch Levy, David W. Low |
A Contraction Algorithm for Finding Small Cycle Cutsets. |
J. Algorithms |
1988 |
DBLP DOI BibTeX RDF |
|
24 | Aparna Ramanathan, Charles J. Colbourn |
Counting almost minimum cutsets with reliability applications. |
Math. Program. |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Richard J. Nowakowski |
Cutsets of Boolean lattices. |
Discret. Math. |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Pierre Duchet, Michel Las Vergnas, Henry Meyniel |
Connected cutsets of a graph and triangle bases of the cycle space. |
Discret. Math. |
1986 |
DBLP DOI BibTeX RDF |
|
24 | Douglas R. Shier, David E. Whited |
Iterative algorithms for generating minimal cutsets in directed graphs. |
Networks |
1986 |
DBLP DOI BibTeX RDF |
|
24 | Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank |
The Traveling Salesman Problem in Graphs with 3-Edge Cutsets |
J. ACM |
1985 |
DBLP DOI BibTeX RDF |
|
24 | Vasek Chvátal |
Star-cutsets and perfect graphs. |
J. Comb. Theory, Ser. B |
1985 |
DBLP DOI BibTeX RDF |
|
24 | Alan Tucker |
Coloring graphs with stable cutsets. |
J. Comb. Theory, Ser. B |
1983 |
DBLP DOI BibTeX RDF |
|
24 | Bernd Meyer 0009 |
On the Lattices of Cutsets in Finite Graphs. |
Eur. J. Comb. |
1982 |
DBLP DOI BibTeX RDF |
|
24 | Barry K. Rosen |
Robust Linear Algorithms for Cutsets. |
J. Algorithms |
1982 |
DBLP DOI BibTeX RDF |
|
24 | Shuji Tsukiyama, Isao Shirakawa, Hiroshi Ozaki, Hiromu Ariyoshi |
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset. |
J. ACM |
1980 |
DBLP DOI BibTeX RDF |
|
24 | Adi Shamir |
A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs. |
SIAM J. Comput. |
1979 |
DBLP DOI BibTeX RDF |
|
24 | Egon Balas, Eitan Zemel |
Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes. |
Math. Oper. Res. |
1977 |
DBLP DOI BibTeX RDF |
|