Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Hack06/LexBFS

Open more actions menu

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
6 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LexBFS

University project for distinguishing Chordal graphs and matrices having Consecutive-Ones property.

References

[1] M. Habib, R. McConnell, C. Paul, L. Viennot. Lex-BFS and Partition Refinement, with Applications to Transitive Orientation, Interval Graph Recognition and Consecutive Ones Testing, 1996.

[2] M. Habib, R. McConnell, C. Paul, L. Viennot. Lex-BFS, a Partition Refining Technique. Application to Transitive Orientation, Interval Graph Recognition and Consecutive 1's Testing, 1996.

[3] D. Rose, R. Tarjan, G. Lueker. Algorithmic Aspects of Vertex Elimination on Graphs, 1976.

[4] M.Golumbic. Algorithmic Graph Theory and Perfect Graphs, Second Edition, 2004.

About

University project for distinguishing Chordal graphs and matrices having Consecutive-Ones property.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages

Morty Proxy This is a proxified and sanitized view of the page, visit original site.