Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

End-vertices of AT-free bigraphs

From MaRDI portal
Publication:2019435
Jump to:navigation, search

DOI10.1007/978-3-030-58150-3_5OpenAlexW3082397916MaRDI QIDQ2019435FDOQ2019435

J. Gorzny, Jing Huang

Publication date: 21 April 2021


Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_5





zbMATH Keywords

breadth-first searchdepth-first searchbipartite permutation graphproper interval bigraphlexicographic breadth-first searchAT-free bigraphend-vertex problemmaximal neighbourhood search


Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)



Cited In (1)

  • End vertices of graph searches on bipartite graphs





This page was built for publication: End-vertices of AT-free bigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019435)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2019435&oldid=14488229"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 18:34. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki